X-Git-Url: https://www.fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;f=mtp.cc;h=957e56f997a7241d16a30df1ebda021ab80615a6;hb=f419bacb4b11f42f87e6e9bc9e8a4719499559f2;hp=ce9e56bc55dc566682543ac44b03da911cf9e5e6;hpb=b33d04fc473e7de0f9d404b014fb694b7ee6c661;p=mtp.git diff --git a/mtp.cc b/mtp.cc index ce9e56b..957e56f 100644 --- a/mtp.cc +++ b/mtp.cc @@ -1,127 +1,155 @@ -/////////////////////////////////////////////////////////////////////////// -// 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 // -/////////////////////////////////////////////////////////////////////////// - -// Multi-Tracked Path - -// Takes the graph description file as input and produces a dot file. - -// EXAMPLE: ./mtp ./graph2.txt | dot -T pdf -o- | xpdf - +/* + * 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 . + * + */ #include #include -#include -#include -#include -#include +#include +#include +#include using namespace std; -#include "mtp_graph.h" -#include "tracker.h" +#include "mtp_tracker.h" -////////////////////////////////////////////////////////////////////// +#define FILENAME_SIZE 1024 -void find_best_paths(int nb_vertices, - int nb_edges, int *ea, int *eb, scalar_t *el, - int source, int sink, - int *result_edge_occupation) { - MTPGraph graph(nb_vertices, nb_edges, ea, eb, source, sink); - graph.find_best_paths(el, result_edge_occupation); +char trajectory_filename[FILENAME_SIZE]; +char graph_filename[FILENAME_SIZE]; +int verbose; + +void usage(ostream *os) { + (*os) << "mtp [-h|--help] [-v|--verbose] [-t|--trajectory-filename ] [-g|--graph-filename ] []" << endl; } -////////////////////////////////////////////////////////////////////// +scalar_t diff_in_second(struct timeval *start, struct timeval *end) { + return + scalar_t(end->tv_sec - start->tv_sec) + + scalar_t(end->tv_usec - start->tv_usec)/1000000; +} -int main(int argc, char **argv) { - // int nb_locations = 6; - // int nb_time_steps = 5; - - // { - // Tracker tracker(nb_time_steps, nb_locations); - - // for(int l = 0; l < nb_locations; l++) { - // for(int k = 0; k < nb_locations; k++) { - // tracker.set_allowed_motion(l, k, abs(l - k) <= 1); - // } - // } - - // for(int t = 0; t < nb_time_steps; t++) { - // for(int l = 0; l < nb_locations; l++) { - // tracker.set_detection_score(t, l, - // (drand48() < 0.9 ? -1.0 : 1.0) + drand48() * 0.1 - 0.05); - // } - // tracker.set_detection_score(t, 0, - // (drand48() < 0.9 ? 1.0 : -1.0) + drand48() * 0.1 - 0.05); - // } - - // tracker.build_graph(); - // tracker.track(); - // } - - // exit(0); - - if(argc < 2) { - cerr << argv[0] << " " << endl; - exit(EXIT_FAILURE); +void do_tracking(istream *in_tracker) { + timeval start_time, end_time; + MTPTracker *tracker = new MTPTracker(); + + if(verbose) { cout << "Reading the tracking parameters." << endl; } + tracker->read(in_tracker); + + if(verbose) { cout << "Building the graph ... "; cout.flush(); } + gettimeofday(&start_time, 0); + tracker->build_graph(); + gettimeofday(&end_time, 0); + if(verbose) { cout << "done (" << diff_in_second(&start_time, &end_time) << "s)." << endl; } + + if(verbose) { cout << "Tracking ... "; cout.flush(); } + gettimeofday(&start_time, 0); + tracker->track(); + gettimeofday(&end_time, 0); + if(verbose) { cout << "done (" << diff_in_second(&start_time, &end_time) << "s)." << endl; } + + if(strcmp(trajectory_filename, "")) { + ofstream out_traj(trajectory_filename); + tracker->write_trajectories(&out_traj); + if(verbose) { cout << "Wrote " << trajectory_filename << "." << endl; } + } else { + tracker->write_trajectories(&cout); } - ifstream *file = new ifstream(argv[1]); + if(strcmp(graph_filename, "") != 0) { + ofstream out_dot(graph_filename); + tracker->print_graph_dot(&out_dot); + if(verbose) { cout << "Wrote " << graph_filename << "." << endl; } + } - int nb_edges, nb_vertices; - int source, sink; + delete tracker; +} - if(file->good()) { +static struct option long_options[] = { + { "trajectory-file", 1, 0, 't' }, + { "graph-file", 1, 0, 'g' }, + { "help", no_argument, 0, 'h' }, + { "verbose", no_argument, 0, 'v' }, + { 0, 0, 0, 0 } +}; - (*file) >> nb_vertices >> nb_edges; - (*file) >> source >> sink; +int main(int argc, char **argv) { + int c; + int error = 0, show_help = 0; - scalar_t *edge_lengths = new scalar_t[nb_edges]; - int *vertex_from = new int[nb_edges]; - int *vertex_to = new int[nb_edges]; - int *result_edge_occupation = new int[nb_edges]; + // strncpy(trajectory_filename, "result.trj", FILENAME_SIZE); + strncpy(trajectory_filename, "", FILENAME_SIZE); + strncpy(graph_filename, "", FILENAME_SIZE); + verbose = 0; - for(int e = 0; e < nb_edges; e++) { - (*file) >> vertex_from[e] >> vertex_to[e] >> edge_lengths[e]; - } + while ((c = getopt_long(argc, argv, "t:g:hv", + long_options, NULL)) != -1) { - find_best_paths(nb_vertices, nb_edges, - vertex_from, vertex_to, edge_lengths, - source, sink, - result_edge_occupation); + switch(c) { - // dot_print(nb_vertices, nb_edges, - // vertex_from, vertex_to, edge_lengths, - // source, sink, - // result_edge_occupation); + case 't': + strncpy(trajectory_filename, optarg, FILENAME_SIZE); + break; - delete[] result_edge_occupation; - delete[] edge_lengths; - delete[] vertex_from; - delete[] vertex_to; + case 'g': + strncpy(graph_filename, optarg, FILENAME_SIZE); + break; - } else { + case 'h': + show_help = 1; + break; - cerr << "Can not open " << argv[1] << endl; + case 'v': + verbose = 1; + break; - delete file; + default: + error = 1; + break; + } + } + + if(error) { + usage(&cerr); exit(EXIT_FAILURE); + } + if(show_help) { + usage(&cout); + exit(EXIT_SUCCESS); + } + + if(optind < argc) { + ifstream *file_in_tracker = new ifstream(argv[optind]); + if(file_in_tracker->good()) { + do_tracking(file_in_tracker); + } else { + cerr << "Can not open " << argv[optind] << endl; + exit(EXIT_FAILURE); + } + delete file_in_tracker; + } else { + do_tracking(&cin); } - delete file; exit(EXIT_SUCCESS); }