X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=tracker.h;h=c21df97a7f481711a64b489a30b514a3fb516109;hb=ddbc8b15ea4ff788e10cffd2d3977b65462dd1a7;hp=d8cb811c40a1d51e4aeb651896684e585f1b0be6;hpb=ea33e3e5dddbe3796d2361910e1e3ed98a19865c;p=mtp.git

diff --git a/tracker.h b/tracker.h
index d8cb811..c21df97 100644
--- a/tracker.h
+++ b/tracker.h
@@ -1,24 +1,34 @@
 
-///////////////////////////////////////////////////////////////////////////
-// 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 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/>.
+ *
+ */
 
 #ifndef TRACKER_H
 #define TRACKER_H
 
+#include <iostream>
+
+using namespace std;
+
 #include "misc.h"
 #include "mtp_graph.h"
 
@@ -26,25 +36,49 @@ class Tracker {
   int _nb_locations, _nb_time_steps;
   scalar_t **_detection_score;
   int **_allowed_motion;
+  int *_entrances, *_exits;
 
   MTPGraph *_graph;
-  int *_edge_occupation;
   scalar_t *_edge_lengths;
+
+  int early_pair_node(int t, int l);
+  int late_pair_node(int t, int l);
+
 public:
-  Tracker(int nb_time_steps, int nb_locations);
+
+  // The spatial structure
+  int **allowed_motion;
+  int *entrances, *exits;
+
+  // The detection scores at each node
+  scalar_t **detection_scores;
+
+  Tracker();
   ~Tracker();
 
-  void set_allowed_motion(int from_location, int to_location, int v);
+  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();
+  void print_graph_dot(ostream *os);
 
-  void set_detection_score(int time, int location, scalar_t score);
+  // Compute the optimal set of trajectories
 
   void track();
 
-  // int nb_trajectories();
-  // int trajectory_start_time(int k);
-  // int trajectory_end_time(int k);
-  // int trajectory_location(int k, int time);
+  // 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_from_entry);
 };
 
 #endif