X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;ds=inline;f=mtp.cc;h=c6d31b3f9cebdd2c7fa726e0a69dd21d30f909d0;hb=02bc2f6135e8d64916147b262654059e0f91a6df;hp=1af71afbf4ff8a44b15026097467a42b60bbc1ad;hpb=5b2943dfdbc77edc1f5f8bfa1f19102c6c049cc8;p=mtp.git
diff --git a/mtp.cc b/mtp.cc
index 1af71af..c6d31b3 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -1,81 +1,71 @@
-///////////////////////////////////////////////////////////////////////////
-// 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
-#include
using namespace std;
-#include "tracker.h"
+#include "mtp_tracker.h"
-//////////////////////////////////////////////////////////////////////
+int main(int argc, char **argv) {
-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 = 1000;
- int nb_time_steps = 1000;
- 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->set_allowed_motion(l, k, abs(l - k) <= motion_amplitude);
- }
- tracker->set_as_entrance(0, 1);
- tracker->set_as_exit(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->set_detection_score(t, l, detection_score(-1, 0.95));
- }
- tracker->set_detection_score(t, nb_locations/2, detection_score(1, 0.95));
- }
+ tracker->read(in_tracker);
+ cout << "Read " << argv[1] << endl;
+
+ tracker->build_graph();
+ tracker->track();
+
+ 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 {
- tracker->track();
+ cerr << "Can not open " << argv[1] << endl;
+ exit(EXIT_FAILURE);
- for(int t = 0; t < tracker->nb_trajectories(); t++) {
- cout << "TRAJECTORY "
- << t
- << " [starting " << tracker->trajectory_entrance_time(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);
}