X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=tracker.h;h=c21df97a7f481711a64b489a30b514a3fb516109;hb=50f548312764a481b3ee3b9153b0b738e2ecca17;hp=4143cf590c70ac0a25235f4de85e0b9a649a242b;hpb=455e5736828233445ac8aea8f15b3bde7e16e9bf;p=mtp.git diff --git a/tracker.h b/tracker.h index 4143cf5..c21df97 100644 --- a/tracker.h +++ b/tracker.h @@ -1,46 +1,84 @@ -/////////////////////////////////////////////////////////////////////////// -// 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 . // -// // -// Written by and Copyright (C) Francois Fleuret // -// Contact 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 + * + * 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 . + * + */ #ifndef TRACKER_H #define TRACKER_H +#include + +using namespace std; + #include "misc.h" #include "mtp_graph.h" class Tracker { int _nb_locations, _nb_time_steps; - MTPGraph *_graph; scalar_t **_detection_score; int **_allowed_motion; + int *_entrances, *_exits; + + MTPGraph *_graph; + 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); - void set_detection_score(int time, int location, scalar_t score); + 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); + + // 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