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

diff --git a/mtp.cc b/mtp.cc
index 118e521..c1387d9 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -18,101 +18,104 @@
 
 // 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);
-}
-
-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;
-    }
+scalar_t detection_score(scalar_t a, scalar_t b, scalar_t score_noise, scalar_t flip_noise) {
+  if(drand48() > flip_noise) {
+    return a + score_noise * (2.0 * drand48() - 1.0);
+  } else {
+    return b + score_noise * (2.0 * drand48() - 1.0);
   }
-  cout << "}" << endl;
 }
 
-//////////////////////////////////////////////////////////////////////
-
 int main(int argc, char **argv) {
+  int nb_locations = 7;
+  int nb_time_steps = 8;
+  int motion_amplitude = 1;
 
-  if(argc < 2) {
-    cerr << argv[0] << " <graph file>" << endl;
-    exit(EXIT_FAILURE);
-  }
-
-  ifstream *file = new ifstream(argv[1]);
+  Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
 
-  int nb_edges, nb_vertices;
-  int source, sink;
+  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;
+  }
 
-  if(file->good()) {
+  tracker->build_graph();
 
-    (*file) >> nb_vertices >> nb_edges;
-    (*file) >> source >> sink;
+  // We generate synthetic detection scores at location
+  // nb_locations/2, with 5% 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];
+  scalar_t flip_noise = 0.05;
+  scalar_t score_noise = 0.0;
 
-    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->detection_score[t][l] = detection_score(-1.0, 1.0, score_noise, flip_noise);
     }
+  }
 
-    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);
+  // for(int t = 0; t < nb_time_steps; t++) {
+    // tracker->detection_score[t][nb_locations/2] = detection_score(1, score_noise, flip_noise);
+  // }
+
+  // Puts two target with the typical local minimum
+
+  int la, lb;
+  scalar_t sa, sb;
+  for(int t = 0; t < nb_time_steps; t++) {
+    // Target a moves from location 0 to the middle and comes back,
+    // and is strongly detected on the first half, target b moves from
+    // location nb_locations-1 to the middle and comes back, and is
+    // strongly detected on the second half
+    if(t < nb_time_steps/2) {
+      la = t;
+      lb = nb_locations - 1 - t;
+      sa = detection_score(10.0, -1.0, score_noise, flip_noise);
+      sb = detection_score( 1.0, -1.0, score_noise, flip_noise);
+    } else {
+      la = nb_time_steps - 1 - t;
+      lb = t - nb_time_steps + nb_locations;
+      sa = detection_score( 1.0, -1.0, score_noise, flip_noise);
+      sb = detection_score(10.0, -1.0, score_noise, flip_noise);
+    }
 
-    delete[] result_edge_occupation;
-    delete[] edge_lengths;
-    delete[] vertex_from;
-    delete[] vertex_to;
+    if(la > nb_locations/2 - 1) la = nb_locations/2 - 1;
+    if(lb < nb_locations/2 + 1) lb = nb_locations/2 + 1;
 
-  } else {
+    tracker->detection_score[t][la] = sa;
+    tracker->detection_score[t][lb] = sb;
+  }
 
-    cerr << "Can not open " << argv[1] << endl;
+  tracker->track();
 
-    delete file;
-    exit(EXIT_FAILURE);
+  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 file;
+  delete tracker;
+
   exit(EXIT_SUCCESS);
 }