-///////////////////////////////////////////////////////////////////////////
-// 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 Path'', an implementation of the
+ * k-shortest path 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/>.
+ *
+ */
#ifndef TRACKER_H
#define TRACKER_H
MTPGraph *_graph;
scalar_t *_edge_lengths;
+
+ int early_pair_node(int t, int l);
+ int late_pair_node(int t, int l);
+
public:
- scalar_t **detection_score;
+
+ // The spatial structure
int **allowed_motion;
int *entrances, *exits;
- Tracker(int nb_time_steps, int nb_locations);
+ // The detection scores at each node
+ scalar_t **detection_scores;
+
+ Tracker();
~Tracker();
+ void allocate(int nb_time_steps, int nb_locations);
+ void free();
+
+ void write(ostream *os);
+ void read(istream *is);
+ void write_trajectories(ostream *os);
+
// Build or print the graph needed for the tracking per se
void build_graph();
// Read-out of the optimal trajectories
int nb_trajectories();
+ scalar_t trajectory_score(int k);
int trajectory_entrance_time(int k);
int trajectory_duration(int k);
- int trajectory_location(int k, int time);
+ int trajectory_location(int k, int time_from_entry);
};
#endif