X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_example.cc;h=0db60542c49737432530a1518710f40fed1a4227;hb=2c79f2f3d73d7dc7a8c799ad9386484a5a684ca4;hp=e615cf113e6d8898c548e041f365013ca3bbb590;hpb=68d9c4f175f774d851a32f6069ad04b31924bfac;p=mtp.git diff --git a/mtp_example.cc b/mtp_example.cc index e615cf1..0db6054 100644 --- a/mtp_example.cc +++ b/mtp_example.cc @@ -1,7 +1,7 @@ /* - * mtp is the ``Multi Tracked Path'', an implementation of the - * k-shortest path algorithm for multi-target tracking. + * 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 @@ -22,8 +22,6 @@ * */ -// Multi-Tracked Path - #include #include @@ -33,11 +31,12 @@ using namespace std; ////////////////////////////////////////////////////////////////////// -scalar_t detection_score(scalar_t a, scalar_t b, scalar_t score_noise, scalar_t flip_noise) { - if(drand48() > flip_noise) { - return a + score_noise * (2.0 * drand48() - 1.0); +scalar_t noisy_score(scalar_t true_score, scalar_t erroneous_score, + scalar_t score_noise, scalar_t flip_noise) { + if(drand48() < flip_noise) { + return erroneous_score + score_noise * (2.0 * drand48() - 1.0); } else { - return b + score_noise * (2.0 * drand48() - 1.0); + return true_score + score_noise * (2.0 * drand48() - 1.0); } } @@ -81,7 +80,7 @@ int main(int argc, char **argv) { for(int t = 0; t < nb_time_steps; t++) { for(int l = 0; l < nb_locations; l++) { - tracker->detection_scores[t][l] = detection_score(-1.0, 1.0, score_noise, flip_noise); + tracker->detection_scores[t][l] = noisy_score(-1.0, 1.0, score_noise, flip_noise); } } @@ -101,13 +100,13 @@ int main(int argc, char **argv) { if(t < nb_time_steps/2) { la = t; lb = nb_locations - 1 - t; - sa = detection_score(10.0, -1.0, score_noise, flip_noise); - sb = detection_score( 1.0, -1.0, score_noise, flip_noise); + sa = noisy_score(10.0, -1.0, score_noise, flip_noise); + sb = noisy_score( 1.0, -1.0, score_noise, flip_noise); } else { la = nb_time_steps - 1 - t; lb = t - nb_time_steps + nb_locations; - sa = detection_score( 1.0, -1.0, score_noise, flip_noise); - sb = detection_score(10.0, -1.0, score_noise, flip_noise); + sa = noisy_score( 1.0, -1.0, score_noise, flip_noise); + sb = noisy_score(10.0, -1.0, score_noise, flip_noise); } if(la > nb_locations/2 - 1) la = nb_locations/2 - 1;