-///////////////////////////////////////////////////////////////////////////
-// 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/>.
+ *
+ */
#include "tracker.h"
// The edges from the source to the first frame, and from the last
// frame to the sink
_nb_locations * 2 +
- // The edges from the source to the entrances and from the exists
+ // The edges from the source to the entrances and from the exits
// to the sink (in every time frames but the first for the
// entrances, and last for the exits)
(_nb_time_steps - 1) * (nb_exits + nb_entrances) +
}
}
+ // The edges from the source to the first time frame
+
for(int l = 0; l < _nb_locations; l++) {
node_from[e] = source;
node_to[e] = 1 + l + 0 * _nb_locations;
e++;
}
- for(int t = 0; t < _nb_time_steps; t++) {
+ // The edges from the last frame to the sink
+
+ for(int l = 0; l < _nb_locations; l++) {
+ node_from[e] = late_pair_node(_nb_time_steps - 1, l);
+ node_to[e] = sink;
+ _edge_lengths[e] = 0.0;
+ e++;
+ }
+
+ // The edges between frames, corresponding to allowed motions
+
+ for(int t = 0; t < _nb_time_steps - 1; t++) {
for(int l = 0; l < _nb_locations; l++) {
- if(t == _nb_time_steps - 1) {
- node_from[e] = late_pair_node(t, l);
- node_to[e] = sink;
- _edge_lengths[e] = 0.0;
- e++;
- } else {
- for(int k = 0; k < _nb_locations; k++) {
- if(allowed_motion[l][k]) {
- node_from[e] = late_pair_node(t, l);
- node_to[e] = early_pair_node(t+1, k);
- _edge_lengths[e] = 0.0;
- e++;
- }
+ for(int k = 0; k < _nb_locations; k++) {
+ if(allowed_motion[l][k]) {
+ node_from[e] = late_pair_node(t, l);
+ node_to[e] = early_pair_node(t+1, k);
+ _edge_lengths[e] = 0.0;
+ e++;
}
}
}
}
+ // The edges from the source to the entrances, and from the exits to
+ // the sink
+
for(int t = 0; t < _nb_time_steps; t++) {
for(int l = 0; l < _nb_locations; l++) {
if(t > 0 && entrances[l]) {
}
}
+ // We are done, build the graph
+
_graph = new MTPGraph(nb_vertices, nb_edges,
node_from, node_to,
source, sink);