#include <iostream>
#include <fstream>
-#include <stdlib.h>
using namespace std;
}
int main(int argc, char **argv) {
- int nb_locations = 1000;
- int nb_time_steps = 1000;
+ int nb_locations = 6;
+ int nb_time_steps = 5;
int motion_amplitude = 1;
Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
for(int l = 0; l < nb_locations; l++) {
for(int k = 0; k < nb_locations; k++) {
- tracker->set_allowed_motion(l, k, abs(l - k) <= motion_amplitude);
+ tracker->allowed_motion[l][k] = abs(l - k) <= motion_amplitude;
}
- tracker->set_as_entrance(0, 1);
- tracker->set_as_exit(nb_locations - 1, 1);
+ tracker->entrances[0] = 1;
+ tracker->exits[nb_locations - 1] = 1;
}
tracker->build_graph();
- // We repeat several times the same tracking to check how stable it
- // is
+ // We generate synthetic detection scores at location
+ // nb_locations/2, with 5% false detection (FP or FN)
- for(int r = 0; r < 1; r++) {
- cout << "* ROUND " << r << endl;
-
- // We generate synthetic detection scores at location
- // nb_locations/2, with 10% false detection (FP or FN)
-
- for(int t = 0; t < nb_time_steps; t++) {
- for(int l = 0; l < nb_locations; l++) {
- tracker->set_detection_score(t, l, detection_score(-1, 0.95));
- }
- tracker->set_detection_score(t, nb_locations/2, detection_score(1, 0.95));
+ for(int t = 0; t < nb_time_steps; t++) {
+ for(int l = 0; l < nb_locations; l++) {
+ tracker->detection_score[t][l] = detection_score(-1, 0.95);
}
+ }
- tracker->track();
+ for(int t = 0; t < nb_time_steps; t++) {
+ tracker->detection_score[t][nb_locations/2] = detection_score(1, 0.95);
+ }
- for(int t = 0; t < tracker->nb_trajectories(); t++) {
- cout << "TRAJECTORY "
- << t
- << " [starting " << tracker->trajectory_entrance_time(t) << "]";
- for(int u = 0; u < tracker->trajectory_duration(t); u++) {
- cout << " " << tracker->trajectory_location(t, u);
- }
- cout << endl;
+ // Puts two target with the typical local minimum (i.e. the optimal
+ // single path would track the first target on the first half and
+ // the second on the second half, while the optimal two paths would
+ // each follow one of the target properly)
+
+ // for(int t = 0; t < nb_time_steps; t++) {
+ // int a = nb_time_steps/2 - abs(t - nb_time_steps/2);
+ // int b = nb_locations - 1 - a;
+ // if(a > nb_locations/2 - 1) a = nb_locations/2 - 1;
+ // if(b < nb_locations/2 + 1) b = nb_locations/2 + 1;
+ // if(t < nb_time_steps/2) {
+ // tracker->detection_score[t][a] = 10.0;
+ // tracker->detection_score[t][b] = 1.0;
+ // } else {
+ // tracker->detection_score[t][a] = 1.0;
+ // tracker->detection_score[t][b] = 10.0;
+ // }
+ // }
+
+ tracker->track();
+
+ for(int t = 0; t < tracker->nb_trajectories(); t++) {
+ cout << "TRAJECTORY "
+ << t
+ << " [starting " << tracker->trajectory_entrance_time(t)
+ << ", score " << tracker->trajectory_score(t) << "]";
+ for(int u = 0; u < tracker->trajectory_duration(t); u++) {
+ cout << " " << tracker->trajectory_location(t, u);
}
+ cout << endl;
+ }
+
+ {
+ ofstream dot("graph.dot");
+ tracker->print_graph_dot(&dot);
+ cout << "Wrote graph.dot." << endl;
}
delete tracker;