X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp.cc;h=f2db0c65a3cdc15587e1211920df203c31b31ce3;hb=9490c76beeea6435b0d51dc2dc1c4c11f4054a2c;hp=cd1290c767d480713c0e701630837a537807fc91;hpb=ae55303c805d340b8c4a3d080ecdadb41c84a9ec;p=mtp.git

diff --git a/mtp.cc b/mtp.cc
index cd1290c..f2db0c6 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -25,85 +25,38 @@ using namespace std;
 
 #include "tracker.h"
 
-//////////////////////////////////////////////////////////////////////
+int main(int argc, char **argv) {
 
-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);
+  if(argc < 2) {
+    cerr << argv[0] << " <tracker file>" << endl;
+    exit(EXIT_FAILURE);
   }
-}
 
-int main(int argc, char **argv) {
-  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->allowed_motion[l][k] = abs(l - k) <= motion_amplitude;
-    }
-    tracker->entrances[0] = 1;
-    tracker->exits[nb_locations - 1] = 1;
-  }
+  Tracker tracker;
 
-  tracker->build_graph();
+  ifstream in_tracker(argv[1]);
 
-  // We generate synthetic detection scores at location
-  // nb_locations/2, with 5% false detection (FP or FN)
+  if(in_tracker.good()) {
 
-  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.read(&in_tracker);
+    tracker.build_graph();
+    tracker.track();
+    cout << "Read " << argv[1] << endl;
 
-  for(int t = 0; t < nb_time_steps; t++) {
-    tracker->detection_score[t][nb_locations/2] = detection_score(1, 0.95);
-  }
+    ofstream out_traj("result.trj");
+    tracker.write_trajectories(&out_traj);
+    cout << "Wrote result.trj" << 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 out_dot("graph.dot");
+    tracker.print_graph_dot(&out_dot);
+    cout << "Wrote graph.dot" << endl;
 
-  {
-    ofstream dot("graph.dot");
-    tracker->print_graph_dot(&dot);
-    cout << "Wrote graph.dot." << endl;
-  }
+  } else {
+
+    cerr << "Can not open " << argv[1] << endl;
+    exit(EXIT_FAILURE);
 
-  delete tracker;
+  }
 
   exit(EXIT_SUCCESS);
 }