X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp.cc;h=a3f4aa3872f3f30296ec906e2583a8d334956944;hb=897732507b36b4fc2099f7c54536d278a93d4531;hp=118e521678e05f415b80173cf421f3830b0a38a2;hpb=0f54e5005de0f05d4bc400f23181301eb40f469e;p=mtp.git

diff --git a/mtp.cc b/mtp.cc
index 118e521..a3f4aa3 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -22,97 +22,52 @@
 
 // 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"
-
-//////////////////////////////////////////////////////////////////////
-
-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);
-}
-
-void dot_print(int nb_vertices,
-               int nb_edges, int *ea, int *eb, scalar_t *el,
-               int source, int sink,
-               int *edge_occupation) {
-  cout << "digraph {" << endl;
-  cout << "  node[shape=circle];" << endl;
-  for(int e = 0; e < nb_edges; e++) {
-    if(edge_occupation[e]) {
-      cout << "  " << ea[e] << " -> " << eb[e] << " [style=bold,color=black,label=\"" << el[e] << "\"];" << endl;
-    } else {
-      cout << "  " << ea[e] << " -> " << eb[e] << " [color=gray,label=\"" << el[e] << "\"];" << endl;
-    }
-  }
-  cout << "}" << endl;
-}
+#include "tracker.h"
 
 //////////////////////////////////////////////////////////////////////
 
 int main(int argc, char **argv) {
+  int nb_locations = 20;
+  int nb_time_steps = 50;
+  int motion_amplitude = 2;
 
-  if(argc < 2) {
-    cerr << argv[0] << " <graph file>" << endl;
-    exit(EXIT_FAILURE);
-  }
-
-  ifstream *file = new ifstream(argv[1]);
-
-  int nb_edges, nb_vertices;
-  int source, sink;
+  Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
 
-  if(file->good()) {
-
-    (*file) >> nb_vertices >> nb_edges;
-    (*file) >> source >> sink;
-
-    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 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);
     }
+  }
 
-    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;
+  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.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);
+    }
 
-    delete file;
-    exit(EXIT_FAILURE);
+    tracker->build_graph();
+    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;
+    }
   }
 
-  delete file;
+  delete tracker;
+
   exit(EXIT_SUCCESS);
 }