2 ///////////////////////////////////////////////////////////////////////////
3 // This program is free software: you can redistribute it and/or modify //
4 // it under the terms of the version 3 of the GNU General Public License //
5 // as published by the Free Software Foundation. //
7 // This program is distributed in the hope that it will be useful, but //
8 // WITHOUT ANY WARRANTY; without even the implied warranty of //
9 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU //
10 // General Public License for more details. //
12 // You should have received a copy of the GNU General Public License //
13 // along with this program. If not, see <http://www.gnu.org/licenses/>. //
15 // Written by and Copyright (C) Francois Fleuret //
16 // Contact <francois.fleuret@idiap.ch> for comments & bug reports //
17 ///////////////////////////////////////////////////////////////////////////
21 // Takes the graph description file as input and produces a dot file.
23 // EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf -
32 //////////////////////////////////////////////////////////////////////
34 int main(int argc, char **argv) {
35 int nb_locations = 20;
36 int nb_time_steps = 50;
37 int motion_amplitude = 2;
39 Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
41 for(int l = 0; l < nb_locations; l++) {
42 for(int k = 0; k < nb_locations; k++) {
43 tracker->set_allowed_motion(l, k, abs(l - k) <= motion_amplitude);
47 tracker->build_graph();
49 for(int r = 0; r < 10; r++) {
50 cout << "* ROUND " << r << endl;
51 for(int t = 0; t < nb_time_steps; t++) {
52 for(int l = 0; l < nb_locations; l++) {
53 tracker->set_detection_score(t, l,
54 (drand48() < 0.95 ? -1.0 : 1.0) + drand48() * 0.1 - 0.05);
56 tracker->set_detection_score(t, 0,
57 (drand48() < 0.95 ? 1.0 : -1.0) + drand48() * 0.1 - 0.05);
62 for(int t = 0; t < tracker->nb_trajectories(); t++) {
63 cout << "TRAJECTORY " << t << " :";
64 for(int u = 0; u < tracker->trajectory_duration(t); u++) {
65 cout << " " << tracker->trajectory_location(t, u);