Added the synthetic typical ambiguous case (commented out).

diff --git a/mtp.cc b/mtp.cc
index dab3292..cd1290c 100644 (file)
--- a/mtp.cc
+++ b/mtp.cc
@@ -59,9 +59,31 @@ int main(int argc, char **argv) {
     for(int l = 0; l < nb_locations; l++) {
       tracker->detection_score[t][l] = detection_score(-1, 0.95);
     }
+  }
+
+  for(int t = 0; t < nb_time_steps; t++) {
     tracker->detection_score[t][nb_locations/2] = detection_score(1, 0.95);
   }
 
+  // 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++) {