// Multi-Tracked Path
-// Takes the graph description file as input and produces a dot file.
-
-// EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf -
-
-#define VERBOSE
-
#include <iostream>
#include <fstream>
-#include <cmath>
-#include <stdio.h>
#include <stdlib.h>
-#include <float.h>
using namespace std;
-#include "mtp_graph.h"
#include "tracker.h"
//////////////////////////////////////////////////////////////////////
-void find_best_paths(int nb_vertices,
- int nb_edges, int *ea, int *eb, scalar_t *el,
- int source, int sink,
- int *result_edge_occupation) {
- MTPGraph graph(nb_vertices, nb_edges, ea, eb, source, sink);
- graph.find_best_paths(el, result_edge_occupation);
+scalar_t detection_score(int true_label, scalar_t flip_noise) {
+ if((true_label > 0) == (drand48() < flip_noise)) {
+ return 1.0 + 0.2 * (drand48() - 0.5);
+ } else {
+ return - 1.0 + 0.2 * (drand48() - 0.5);
+ }
}
-//////////////////////////////////////////////////////////////////////
-
int main(int argc, char **argv) {
- int nb_locations = 4;
- int nb_time_steps = 3;
+ int nb_locations = 1000;
+ int nb_time_steps = 1000;
+ int motion_amplitude = 1;
- {
- Tracker tracker(nb_time_steps, nb_locations);
+ 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) <= 1);
- }
+ 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);
}
-
- for(int t = 0; t < nb_time_steps; t++) {
- for(int l = 0; l < nb_locations; l++) {
- tracker.set_detection_score(t, l,
- (drand48() < 0.95 ? -1.0 : 1.0) + drand48() * 0.1 - 0.05);
- }
- tracker.set_detection_score(t, 0,
- (drand48() < 0.95 ? 1.0 : -1.0) + drand48() * 0.1 - 0.05);
- }
-
- tracker.build_graph();
- tracker.track();
- }
-
- exit(0);
-
- if(argc < 2) {
- cerr << argv[0] << " <graph file>" << endl;
- exit(EXIT_FAILURE);
+ tracker->set_as_entrance(0, 1);
+ tracker->set_as_exit(nb_locations - 1, 1);
}
- ifstream *file = new ifstream(argv[1]);
+ tracker->build_graph();
- int nb_edges, nb_vertices;
- int source, sink;
+ // We repeat several times the same tracking to check how stable it
+ // is
- if(file->good()) {
+ for(int r = 0; r < 1; r++) {
+ cout << "* ROUND " << r << endl;
- (*file) >> nb_vertices >> nb_edges;
- (*file) >> source >> sink;
+ // We generate synthetic detection scores at location
+ // nb_locations/2, with 10% false detection (FP or FN)
- scalar_t *edge_lengths = new scalar_t[nb_edges];
- int *vertex_from = new int[nb_edges];
- int *vertex_to = new int[nb_edges];
- int *result_edge_occupation = new int[nb_edges];
-
- for(int e = 0; e < nb_edges; e++) {
- (*file) >> vertex_from[e] >> vertex_to[e] >> edge_lengths[e];
+ 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));
}
- find_best_paths(nb_vertices, nb_edges,
- vertex_from, vertex_to, edge_lengths,
- source, sink,
- result_edge_occupation);
-
- // dot_print(nb_vertices, nb_edges,
- // vertex_from, vertex_to, edge_lengths,
- // source, sink,
- // result_edge_occupation);
-
- delete[] result_edge_occupation;
- delete[] edge_lengths;
- delete[] vertex_from;
- delete[] vertex_to;
-
- } else {
-
- cerr << "Can not open " << argv[1] << endl;
-
- delete file;
- exit(EXIT_FAILURE);
+ tracker->track();
+ 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;
+ }
}
- delete file;
+ delete tracker;
+
exit(EXIT_SUCCESS);
}