X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=mtp.git;a=blobdiff_plain;f=mtp.cc;h=36f09f113bc1ba091751a91590a59c0cafe8b48d;hp=cd1290c767d480713c0e701630837a537807fc91;hb=02b0f31c9e2e4ca12f7f33d63ae7a77de2d711c2;hpb=ae55303c805d340b8c4a3d080ecdadb41c84a9ec
diff --git a/mtp.cc b/mtp.cc
index cd1290c..36f09f1 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -1,109 +1,81 @@
-///////////////////////////////////////////////////////////////////////////
-// 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 . //
-// //
-// Written by and Copyright (C) Francois Fleuret //
-// Contact for comments & bug reports //
-///////////////////////////////////////////////////////////////////////////
-
-// Multi-Tracked Path
+/*
+ * 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
+ *
+ * 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 .
+ *
+ */
#include
#include
using namespace std;
-#include "tracker.h"
+#include "mtp_tracker.h"
-//////////////////////////////////////////////////////////////////////
+int main(int argc, char **argv) {
+ time_t start_time, end_time;
-scalar_t detection_score(int true_label, scalar_t flip_noise) {
- if((true_label > 0) == (drand48() < flip_noise)) {
- return 1.0 + 0.2 * (drand48() - 0.5);
- } else {
- return - 1.0 + 0.2 * (drand48() - 0.5);
+ if(argc < 2) {
+ cerr << argv[0] << " " << endl;
+ exit(EXIT_FAILURE);
}
-}
-int main(int argc, char **argv) {
- int nb_locations = 6;
- int nb_time_steps = 5;
- int motion_amplitude = 1;
-
- Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
-
- 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;
- }
+ ifstream *in_tracker = new ifstream(argv[1]);
- tracker->build_graph();
+ if(in_tracker->good()) {
- // We generate synthetic detection scores at location
- // nb_locations/2, with 5% false detection (FP or FN)
+ MTPTracker *tracker = new MTPTracker();
- 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.95);
- }
- }
+ cout << "Reading " << argv[1] << "." << endl;
+ tracker->read(in_tracker);
- for(int t = 0; t < nb_time_steps; t++) {
- tracker->detection_score[t][nb_locations/2] = detection_score(1, 0.95);
- }
+ cout << "Building the graph ... "; cout.flush();
+ start_time = time(0);
+ tracker->build_graph();
+ end_time = time(0);
+ cout << "done (" << end_time - start_time << "s)." << endl;
- // 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++) {
- 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;
- }
+ cout << "Tracking ... "; cout.flush();
+ start_time = time(0);
+ tracker->track();
+ end_time = time(0);
+ cout << "done (" << end_time - start_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);
- {
- ofstream dot("graph.dot");
- tracker->print_graph_dot(&dot);
- cout << "Wrote graph.dot." << endl;
}
- delete tracker;
+ delete in_tracker;
exit(EXIT_SUCCESS);
}