-
Notifications
You must be signed in to change notification settings - Fork 0
/
similarTrajectory.cpp
233 lines (222 loc) · 7.54 KB
/
similarTrajectory.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
//
// Created by 86173 on 2022/1/27.
//
#include "similarTrajectory.h"
double minSubTrajectory(const path& path1, const path& path2) {
double minDistance = 1000000;
for (int i = 0; i < path2.size() - 1; ++i) {
for (int j = i + 1; j < path2.size(); ++j) {
minDistance = min(wedDistance(path1, path2, i, j), minDistance);
}
}
return minDistance;
}
subResult efficientAlgorithmWED(path path1, path path2) {
int lenPath1 = path1.size();
int lenPath2 = path2.size();
auto allCost = new double[path2.size()];
auto allCostTmp = new double[path2.size()];
auto starts = new int[path2.size()];
auto startsTmp = new int[path2.size()];
double empty[lenPath1];
for (int i = 0; i < lenPath1; ++i) {
if (i == 0) {
empty[i] = distance(nullPoint, path1[i]);
} else {
empty[i] = empty[i - 1] + distance(nullPoint, path1[i]);
}
}
for (int i = 0; i < lenPath1; ++i) {
// cout << "from: ";
for (int j = 0; j < lenPath2; ++j) {
if (i == 0) {
starts[j] = j;
allCost[j] = distance(path1[0], path2[j]);
} else{
// int x = 0;
if (j == 0) {
allCost[0] = min(allCostTmp[0] + distance(nullPoint, path1[i]), empty[i-1] + distance(path1[i], path2[0]));
starts[0] = 0;
continue;
}
double c1 = allCostTmp[j] + distance(nullPoint, path1[i]);
double c2 = allCostTmp[j - 1] + distance(path1[i], path2[j]);
double c3 = allCost[j - 1] + distance(nullPoint, path2[j - 1]) - distance(path1[i], path2[j-1])
+ (c2 - allCostTmp[j-1]);
if (c1 >= c2) {
allCost[j] = c2;
starts[j] = startsTmp[j - 1];
// x = 0;
} else {
allCost[j] = c1;
starts[j] = startsTmp[j];
// x = 1;
}
if (c3 < allCost[j]) {
starts[j] = starts[j-1];
allCost[j] = c3;
// x = -1;
}
// cout << x << " ";
/*
* 8945128451248657
* 9481659841637894616841131216574121965023657864513246364124863125628965130
*/
}
}
// cout << endl;
// for (int j = 0; j < path2.size(); ++j) {
// cout << *(allCost + j) << " ";
// }
// cout << endl;
swap(allCost,allCostTmp);
swap(starts, startsTmp);
}
int start, end = 0;
double res = allCostTmp[0];
for (int j = 0; j < lenPath2; ++j) {
if (res > allCostTmp[j]) {
res = min(res, allCostTmp[j]);
end = j;
}
}
start = startsTmp[end];
delete[] allCostTmp;
delete[] allCost;
delete[] starts;
delete[] startsTmp;
subResult r;
r.first.first = start;
r.first.second = end;
r.second = res;
return r;
}
subResult efficientAlgorithmDTW(path path1, path path2) {
int lenPath1 = path1.size();
int lenPath2 = path2.size();
auto allCost = new double[path2.size()];
auto allCostTmp = new double[path2.size()];
auto starts = new int[path2.size()];
auto startsTmp = new int[path2.size()];
double empty[lenPath1];
for (int i = 0; i < lenPath1; ++i) {
if (i == 0) {
empty[i] = pointDistance(path2[0], path1[i]);
} else {
empty[i] = empty[i - 1] + pointDistance(path2[0], path1[i]);
}
}
for (int i = 0; i < lenPath1; ++i) {
for (int j = 0; j < lenPath2; ++j) {
if (i == 0) {
starts[j] = j;
allCost[j] = pointDistance(path1[0], path2[j]);
} else {
if (j == 0) {
starts[0] = 0;
allCost[0] = min(allCostTmp[0] + pointDistance(path2[0], path1[i]), empty[i-1] + pointDistance(path1[i], path2[0]));
continue;
}
if (allCostTmp[j] >= allCostTmp[j - 1]) {
starts[j] = startsTmp[j - 1];
} else {
starts[j] = startsTmp[j];
}
if (allCostTmp[j] > allCost[j-1] && allCostTmp[j - 1] > allCost[j-1]) {
starts[j] = starts[j - 1];
}
allCost[j] = min(allCostTmp[j], min(allCostTmp[j - 1], allCost[j-1])) + pointDistance(path1[i], path2[j]);
}
}
swap(allCost,allCostTmp);
swap(starts, startsTmp);
}
int start;
int end = 0;
double res = allCostTmp[0];
for (int j = 0; j < lenPath2; ++j) {
if (res > allCostTmp[j]) {
res = min(res, allCostTmp[j]);
end = j;
}
}
start = startsTmp[end];
delete[] allCostTmp;
delete[] allCost;
delete[] starts;
delete[] startsTmp;
subResult r;
r.first.first = start;
r.first.second = end;
r.second = res;
return r;
}
subResult efficientAlgorithmFC(path path1, path path2) {
int lenPath1 = path1.size();
int lenPath2 = path2.size();
auto allCost = new double[path2.size()];
auto allCostTmp = new double[path2.size()];
auto starts = new int[path2.size()];
auto startsTmp = new int[path2.size()];
double empty[lenPath1];
for (int i = 0; i < lenPath1; ++i) {
if (i == 0) {
empty[i] = pointDistance(path2[0], path1[i]);
} else {
empty[i] = max(empty[i - 1], pointDistance(path2[0], path1[i]));
}
}
for (int i = 0; i < lenPath1; ++i) {
for (int j = 0; j < lenPath2; ++j) {
if (i == 0) {
starts[j] = j;
allCost[j] = pointDistance(path1[0], path2[j]);
} else {
if (j == 0) {
starts[0] = 0;
allCost[0] = min(max(allCostTmp[0], pointDistance(path2[0], path1[i])), max(empty[i-1],pointDistance(path1[i], path2[0])));
continue;
}
if (allCostTmp[j] >= allCostTmp[j - 1]) {
starts[j] = startsTmp[j - 1];
} else {
starts[j] = startsTmp[j];
}
if (allCostTmp[j] > allCost[j-1] && allCostTmp[j - 1] > allCost[j-1]) {
starts[j] = starts[j - 1];
}
allCost[j] = max(min(allCostTmp[j], min(allCostTmp[j - 1], allCost[j-1])), pointDistance(path1[i], path2[j]));
}
}
swap(allCost,allCostTmp);
swap(starts, startsTmp);
}
int start;
int end = 0;
double res = allCostTmp[0];
for (int j = 0; j < lenPath2; ++j) {
if (res > allCostTmp[j]) {
res = min(res, allCostTmp[j]);
end = j;
}
}
start = startsTmp[end];
delete[] allCostTmp;
delete[] allCost;
delete[] starts;
delete[] startsTmp;
subResult r;
r.first.first = start;
r.first.second = end;
r.second = res;
return r;
}
subResult efficientAlgorithm(const path& path1, const path& path2) {
if (matricsType == "dtw") {
return efficientAlgorithmDTW(path1, path2);
} else if(matricsType == "FC") {
return efficientAlgorithmFC(path1, path2);
} else {
return efficientAlgorithmWED(path1, path2);
}
}