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 ///////////////////////////////////////////////////////////////////////////
28 //////////////////////////////////////////////////////////////////////
30 scalar_t detection_score(int true_label, scalar_t flip_noise) {
31 if((true_label > 0) == (drand48() < flip_noise)) {
32 return 1.0 + 0.2 * (drand48() - 0.5);
34 return - 1.0 + 0.2 * (drand48() - 0.5);
38 int main(int argc, char **argv) {
40 int nb_time_steps = 5;
41 int motion_amplitude = 1;
43 Tracker *tracker = new Tracker(nb_time_steps, nb_locations);
45 for(int l = 0; l < nb_locations; l++) {
46 for(int k = 0; k < nb_locations; k++) {
47 tracker->allowed_motion[l][k] = abs(l - k) <= motion_amplitude;
49 tracker->entrances[0] = 1;
50 tracker->exits[nb_locations - 1] = 1;
53 tracker->build_graph();
55 // We generate synthetic detection scores at location
56 // nb_locations/2, with 5% false detection (FP or FN)
58 for(int t = 0; t < nb_time_steps; t++) {
59 for(int l = 0; l < nb_locations; l++) {
60 tracker->detection_score[t][l] = detection_score(-1, 0.95);
64 for(int t = 0; t < nb_time_steps; t++) {
65 tracker->detection_score[t][nb_locations/2] = detection_score(1, 0.95);
68 // Puts two target with the typical local minimum (i.e. the optimal
69 // single path would track the first target on the first half and
70 // the second on the second half, while the optimal two paths would
71 // each follow one of the target properly)
73 // for(int t = 0; t < nb_time_steps; t++) {
74 // int a = nb_time_steps/2 - abs(t - nb_time_steps/2);
75 // int b = nb_locations - 1 - a;
76 // if(a > nb_locations/2 - 1) a = nb_locations/2 - 1;
77 // if(b < nb_locations/2 + 1) b = nb_locations/2 + 1;
78 // if(t < nb_time_steps/2) {
79 // tracker->detection_score[t][a] = 10.0;
80 // tracker->detection_score[t][b] = 1.0;
82 // tracker->detection_score[t][a] = 1.0;
83 // tracker->detection_score[t][b] = 10.0;
89 for(int t = 0; t < tracker->nb_trajectories(); t++) {
92 << " [starting " << tracker->trajectory_entrance_time(t)
93 << ", score " << tracker->trajectory_score(t) << "]";
94 for(int u = 0; u < tracker->trajectory_duration(t); u++) {
95 cout << " " << tracker->trajectory_location(t, u);
101 ofstream dot("graph.dot");
102 tracker->print_graph_dot(&dot);
103 cout << "Wrote graph.dot." << endl;