X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp.cc;h=16f05263f204dc9ccb180271894d0c14c77c49d6;hb=de64ce0b1101045816e6731e03d2735356c33ef0;hp=b80f63b76706c35f6971bfa26f2792270236c071;hpb=5b85b5488da0952f823b2c2cfd3793669fc3ac95;p=mtp.git
diff --git a/mtp.cc b/mtp.cc
index b80f63b..16f0526 100644
--- a/mtp.cc
+++ b/mtp.cc
@@ -1,88 +1,73 @@
-///////////////////////////////////////////////////////////////////////////
-// 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 //
-///////////////////////////////////////////////////////////////////////////
+/*
+ * 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 .
+ *
+ */
// Multi-Tracked Path
-// Takes the graph description file as input and produces a dot file.
-
-// EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf -
-
#include
#include
-#include
-#include
-#include
-#include
using namespace std;
-#include "mtp_graph.h"
#include "tracker.h"
-//////////////////////////////////////////////////////////////////////
+int main(int argc, char **argv) {
-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();
-}
+ if(argc < 2) {
+ cerr << argv[0] << " " << endl;
+ exit(EXIT_FAILURE);
+ }
-//////////////////////////////////////////////////////////////////////
+ ifstream *in_tracker = new ifstream(argv[1]);
-int main(int argc, char **argv) {
- int nb_locations = 6;
- int nb_time_steps = 10;
+ if(in_tracker->good()) {
- Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
+ Tracker *tracker = new Tracker();
- 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);
- }
- }
-
- 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);
- }
+ tracker->read(in_tracker);
+ cout << "Read " << argv[1] << endl;
tracker->build_graph();
tracker->track();
- 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;
- }
+ 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);
+
}
- delete tracker;
+ delete in_tracker;
exit(EXIT_SUCCESS);
}