X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp.cc;h=61dcc21692df4a0e69b9e315e8abc66998697683;hb=14e3b33cbe1e0d7deb0b4aa697f6c8b5d43e2963;hp=b80f63b76706c35f6971bfa26f2792270236c071;hpb=5b85b5488da0952f823b2c2cfd3793669fc3ac95;p=mtp.git

diff --git a/mtp.cc b/mtp.cc
index b80f63b..61dcc21 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -1,88 +1,88 @@
 
-///////////////////////////////////////////////////////////////////////////
-// This program is free software: you can redistribute it and/or modify  //
-// it under the terms of the version 3 of the GNU General Public License //
-// as published by the Free Software Foundation.                         //
-//                                                                       //
-// This program is distributed in the hope that it will be useful, but   //
-// WITHOUT ANY WARRANTY; without even the implied warranty of            //
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU      //
-// General Public License for more details.                              //
-//                                                                       //
-// You should have received a copy of the GNU General Public License     //
-// along with this program. If not, see <http://www.gnu.org/licenses/>.  //
-//                                                                       //
-// Written by and Copyright (C) Francois Fleuret                         //
-// Contact <francois.fleuret@idiap.ch> for comments & bug reports        //
-///////////////////////////////////////////////////////////////////////////
-
-// Multi-Tracked Path
-
-// Takes the graph description file as input and produces a dot file.
-
-// EXAMPLE: ./mtp ./graph2.txt  | dot -T pdf -o- | xpdf -
+/*
+ *  mtp is the ``Multi Tracked Paths'', an implementation of the
+ *  k-shortest paths algorithm for multi-target tracking.
+ *
+ *  Copyright (c) 2012 Idiap Research Institute, http://www.idiap.ch/
+ *  Written by Francois Fleuret <francois.fleuret@idiap.ch>
+ *
+ *  This file is part of mtp.
+ *
+ *  mtp is free software: you can redistribute it and/or modify it
+ *  under the terms of the GNU General Public License version 3 as
+ *  published by the Free Software Foundation.
+ *
+ *  mtp is distributed in the hope that it will be useful, but WITHOUT
+ *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ *  or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public
+ *  License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with selector.  If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
 
 #include <iostream>
 #include <fstream>
-#include <cmath>
-#include <stdio.h>
-#include <stdlib.h>
-#include <float.h>
+#include <sys/time.h>
 
 using namespace std;
 
-#include "mtp_graph.h"
-#include "tracker.h"
+#include "mtp_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 diff_in_second(struct timeval *start, struct timeval *end) {
+  return
+    scalar_t(end->tv_sec - start->tv_sec) +
+    scalar_t(end->tv_usec - start->tv_usec)/1000000;
 }
 
-//////////////////////////////////////////////////////////////////////
-
 int main(int argc, char **argv) {
-  int nb_locations = 6;
-  int nb_time_steps = 10;
-
-  Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
+  timeval start_time, end_time;
 
-  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);
-    }
+  if(argc < 2) {
+    cerr << argv[0] << " <tracker file>" << endl;
+    exit(EXIT_FAILURE);
   }
 
-  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);
-    }
+  ifstream *in_tracker = new ifstream(argv[1]);
+
+  if(in_tracker->good()) {
+
+    MTPTracker *tracker = new MTPTracker();
+
+    cout << "Reading " << argv[1] << "." << endl;
+    tracker->read(in_tracker);
 
+    cout << "Building the graph ... "; cout.flush();
+    gettimeofday(&start_time, 0);
     tracker->build_graph();
+    gettimeofday(&end_time, 0);
+    cout << "done (" << diff_in_second(&start_time, &end_time) << "s)." << endl;
+
+    cout << "Tracking ... "; cout.flush();
+    gettimeofday(&start_time, 0);
     tracker->track();
+    gettimeofday(&end_time, 0);
+    cout << "done (" << diff_in_second(&start_time, &end_time) << "s)." << endl;
+
+    ofstream out_traj("result.trj");
+    tracker->write_trajectories(&out_traj);
+    cout << "Wrote result.trj" << endl;
+
+    ofstream out_dot("graph.dot");
+    tracker->print_graph_dot(&out_dot);
+    cout << "Wrote graph.dot" << endl;
+
+    delete tracker;
+
+  } else {
+
+    cerr << "Can not open " << argv[1] << endl;
+    exit(EXIT_FAILURE);
 
-    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 tracker;
+  delete in_tracker;
 
   exit(EXIT_SUCCESS);
 }