X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=mtp.cc;h=979915b57b9b384207648847ac25f9cd8925b34c;hb=535b8ede7d6646ea17135da10c8a16416524f6e9;hp=b80f63b76706c35f6971bfa26f2792270236c071;hpb=5b85b5488da0952f823b2c2cfd3793669fc3ac95;p=mtp.git

diff --git a/mtp.cc b/mtp.cc
index b80f63b..979915b 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -18,68 +18,66 @@
 
 // Multi-Tracked Path
 
-// Takes the graph description file as input and produces a dot file.
-
-// EXAMPLE: ./mtp ./graph2.txt  | dot -T pdf -o- | xpdf -
-
 #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);
-  graph.print_dot();
+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 = 6;
-  int nb_time_steps = 10;
+  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) <= 1);
+      tracker->allowed_motion[l][k] = abs(l - k) <= motion_amplitude;
     }
+    tracker->entrances[0] = 1;
+    tracker->exits[nb_locations - 1] = 1;
   }
 
-  for(int r = 0; r < 10; r++) {
-    cout << "* ROUND " << r << endl;
-    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.9 ? -1.0 : 1.0) + drand48() * 0.1 - 0.05);
-      }
-      tracker->set_detection_score(t, 0,
-                                  (drand48() < 0.9 ? 1.0 : -1.0) + drand48() * 0.1 - 0.05);
+  tracker->build_graph();
+
+  // We generate synthetic detection scores at location
+  // nb_locations/2, with 5% false detection (FP or FN)
+
+  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->detection_score[t][nb_locations/2] = detection_score(1, 0.95);
+  }
 
-    tracker->build_graph();
-    tracker->track();
+  tracker->track();
 
-    for(int t = 0; t < tracker->nb_trajectories(); t++) {
-      cout << "TRAJECTORY " << t << " :";
-      for(int u = 0; u < tracker->trajectory_duration(t); u++) {
-        cout << " " << tracker->trajectory_location(t, u);
-      }
-      cout << endl;
+  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;
+  }
+
+  {
+    ofstream dot("graph.dot");
+    tracker->print_graph_dot(&dot);
+    cout << "Wrote graph.dot." << endl;
   }
 
   delete tracker;