X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp_example.cc;h=0db60542c49737432530a1518710f40fed1a4227;hb=50f548312764a481b3ee3b9153b0b738e2ecca17;hp=52bc4003933873a06695304f4554a6a64ff7b78c;hpb=a0f008effb41b45dd5ae2d51ec98a59cce81c7c3;p=mtp.git

diff --git a/mtp_example.cc b/mtp_example.cc
index 52bc400..0db6054 100644
--- a/mtp_example.cc
+++ b/mtp_example.cc
@@ -1,22 +1,26 @@
 
-///////////////////////////////////////////////////////////////////////////
-// 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        //
-///////////////////////////////////////////////////////////////////////////
-
-// Multi-Tracked Path
+/*
+ *  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 <iostream>
 #include <fstream>
@@ -27,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);
   }
 }
 
@@ -75,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);
     }
   }
 
@@ -95,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;