X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_example.cc;h=d603b3a1928c82765abaa0b6ee1c3b1ae26d3ab0;hb=de64ce0b1101045816e6731e03d2735356c33ef0;hp=13cd4f106d0e1d4a4ccca22dbdd2d8232d0ebb8d;hpb=9665f6b8d842f02facda1590200742482d4362fa;p=mtp.git

diff --git a/mtp_example.cc b/mtp_example.cc
index 13cd4f1..d603b3a 100644
--- a/mtp_example.cc
+++ b/mtp_example.cc
@@ -1,20 +1,26 @@
 
-///////////////////////////////////////////////////////////////////////////
-// 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        //
-///////////////////////////////////////////////////////////////////////////
+/*
+ *  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/>.
+ *
+ */
 
 // Multi-Tracked Path
 
@@ -111,45 +117,30 @@ int main(int argc, char **argv) {
     tracker->detection_scores[t][lb] = sb;
   }
 
-  // Does the tracking per se
-
-  {
-    ofstream out_tracker("/tmp/tracker.dat");
+  { // Write down the tracker setting
+    ofstream out_tracker("tracker.dat");
     tracker->write(&out_tracker);
-
-    ifstream in_tracker("/tmp/tracker.dat");
-    Tracker tracker2;
-    tracker2.read(&in_tracker);
-    tracker2.build_graph();
-    tracker2.track();
-    ofstream out_traj("/tmp/result.trj");
-    tracker2.write_trajectories(&out_traj);
   }
 
+  // Does the tracking per se
+
   tracker->track();
 
   // Prints the detected trajectories
 
   for(int t = 0; t < tracker->nb_trajectories(); t++) {
-    cout << "TRAJECTORY "
+    cout << "Trajectory "
          << t
-         << " [starting " << tracker->trajectory_entrance_time(t)
-         << ", score " << tracker->trajectory_score(t) << "]";
+         << " starting at " << tracker->trajectory_entrance_time(t)
+         << ", duration " << tracker->trajectory_duration(t)
+         << ", score " << tracker->trajectory_score(t)
+         << ", through nodes ";
     for(int u = 0; u < tracker->trajectory_duration(t); u++) {
       cout << " " << tracker->trajectory_location(t, u);
     }
     cout << endl;
   }
 
-  // Save the underlying graph in the dot format, with occupied edges
-  // marked in bold.
-
-  {
-    ofstream dot("graph.dot");
-    tracker->print_graph_dot(&dot);
-    cout << "Wrote graph.dot." << endl;
-  }
-
   delete tracker;
 
   exit(EXIT_SUCCESS);