3 * mtp is the ``Multi Tracked Paths'', an implementation of the
4 * k-shortest paths algorithm for multi-target tracking.
6 * Copyright (c) 2012 Idiap Research Institute, http://www.idiap.ch/
7 * Written by Francois Fleuret <francois.fleuret@idiap.ch>
9 * This file is part of mtp.
11 * mtp is free software: you can redistribute it and/or modify it
12 * under the terms of the GNU General Public License version 3 as
13 * published by the Free Software Foundation.
15 * mtp is distributed in the hope that it will be useful, but WITHOUT
16 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
18 * License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with selector. If not, see <http://www.gnu.org/licenses/>.
25 #include "mtp_graph.h"
35 scalar_t length, positivized_length;
36 Vertex *origin_vertex, *terminal_vertex;
38 // These fields are used for the linked list of a vertex's leaving
39 // edge list. We have to do insertions / deletions.
40 Edge *next_leaving_edge, *pred_leaving_edge;
47 scalar_t distance_from_source;
48 Edge *pred_edge_toward_source;
50 Edge *leaving_edge_list_root;
55 inline void add_leaving_edge(Edge *e);
56 inline void del_leaving_edge(Edge *e);
57 inline void decrease_distance_in_heap(Vertex **heap);
58 inline void increase_distance_in_heap(Vertex **heap, Vertex **heap_bottom);
61 //////////////////////////////////////////////////////////////////////
65 positivized_length = - positivized_length;
66 origin_vertex->del_leaving_edge(this);
67 terminal_vertex->add_leaving_edge(this);
68 swap(terminal_vertex, origin_vertex);
71 //////////////////////////////////////////////////////////////////////
74 leaving_edge_list_root = 0;
77 void Vertex::add_leaving_edge(Edge *e) {
78 e->next_leaving_edge = leaving_edge_list_root;
79 e->pred_leaving_edge = 0;
80 if(leaving_edge_list_root) {
81 leaving_edge_list_root->pred_leaving_edge = e;
83 leaving_edge_list_root = e;
86 void Vertex::del_leaving_edge(Edge *e) {
87 if(e == leaving_edge_list_root) {
88 leaving_edge_list_root = e->next_leaving_edge;
90 if(e->pred_leaving_edge) {
91 e->pred_leaving_edge->next_leaving_edge = e->next_leaving_edge;
93 if(e->next_leaving_edge) {
94 e->next_leaving_edge->pred_leaving_edge = e->pred_leaving_edge;
98 void Vertex::decrease_distance_in_heap(Vertex **heap) {
100 // There is some beauty in that
103 (p = heap + (h - heap + 1) / 2 - 1,
104 (*p)->distance_from_source > (*h)->distance_from_source)) {
106 swap((*p)->heap_slot, (*h)->heap_slot);
111 void Vertex::increase_distance_in_heap(Vertex **heap, Vertex **heap_bottom) {
112 Vertex **c1, **c2, **h;
113 // omg, that's beautiful
115 while(c1 = heap + 2 * (h - heap) + 1,
118 (*c1)->distance_from_source < (*h)->distance_from_source
120 (c2 < heap_bottom && (*c2)->distance_from_source < (*h)->distance_from_source)
122 if(c2 < heap_bottom && (*c2)->distance_from_source <= (*c1)->distance_from_source) {
124 swap((*c2)->heap_slot, (*h)->heap_slot);
128 swap((*c1)->heap_slot, (*h)->heap_slot);
134 //////////////////////////////////////////////////////////////////////
136 static int compare_vertices_on_distance(const void *v1, const void *v2) {
138 (*((Vertex **) v1))->distance_from_source -
139 (*((Vertex **) v2))->distance_from_source;
140 if(delta < 0) return -1;
141 else if(delta > 0) return 1;
145 //////////////////////////////////////////////////////////////////////
147 MTPGraph::MTPGraph(int nb_vertices, int nb_edges,
148 int *vertex_from, int *vertex_to,
149 int source, int sink) {
150 _nb_vertices = nb_vertices;
151 _nb_edges = nb_edges;
153 _edges = new Edge[_nb_edges];
154 _vertices = new Vertex[_nb_vertices];
155 _heap = new Vertex *[_nb_vertices];
156 _dp_order = new Vertex *[_nb_vertices];
158 _source = &_vertices[source];
159 _sink = &_vertices[sink];
161 for(int e = 0; e < nb_edges; e++) {
162 _vertices[vertex_from[e]].add_leaving_edge(&_edges[e]);
163 _edges[e].occupied = 0;
164 _edges[e].origin_vertex = &_vertices[vertex_from[e]];
165 _edges[e].terminal_vertex = &_vertices[vertex_to[e]];
168 for(int v = 0; v < _nb_vertices; v++) {
169 _heap[v] = &_vertices[v];
170 _vertices[v].heap_slot = &_heap[v];
176 compute_dp_ordering();
179 MTPGraph::~MTPGraph() {
184 for(int p = 0; p < nb_paths; p++) delete paths[p];
188 //////////////////////////////////////////////////////////////////////
190 void MTPGraph::print(ostream *os) {
191 for(int k = 0; k < _nb_edges; k++) {
192 Edge *e = &_edges[k];
193 (*os) << e->origin_vertex - _vertices
195 << e->terminal_vertex - _vertices
196 << " (" << e->length << ")";
197 if(e->occupied) { (*os) << " *"; }
202 void MTPGraph::print_dot(ostream *os) {
203 (*os) << "digraph {" << endl;
204 (*os) << " rankdir=\"LR\";" << endl;
205 (*os) << " node [shape=circle,width=0.75,fixedsize=true];" << endl;
206 (*os) << " edge [color=gray,arrowhead=open]" << endl;
207 (*os) << " " << _source - _vertices << " [peripheries=2];" << endl;
208 (*os) << " " << _sink - _vertices << " [peripheries=2];" << endl;
209 for(int k = 0; k < _nb_edges; k++) {
210 Edge *e = &_edges[k];
212 << e->origin_vertex - _vertices
214 << e->terminal_vertex - _vertices
217 (*os) << "style=bold,color=black,";
219 (*os) << "label=\"" << e->length << "\"];" << endl;
221 (*os) << "}" << endl;
224 //////////////////////////////////////////////////////////////////////
226 void MTPGraph::update_positivized_lengths() {
227 for(int k = 0; k < _nb_edges; k++) {
228 Edge *e = &_edges[k];
229 e->positivized_length +=
230 e->origin_vertex->distance_from_source - e->terminal_vertex->distance_from_source;
234 void MTPGraph::force_positivized_lengths() {
236 scalar_t residual_error = 0.0;
237 scalar_t max_error = 0.0;
239 for(int k = 0; k < _nb_edges; k++) {
240 Edge *e = &_edges[k];
242 if(e->positivized_length < 0) {
244 residual_error -= e->positivized_length;
245 max_error = max(max_error, - e->positivized_length);
247 e->positivized_length = 0.0;
251 cerr << __FILE__ << ": residual_error " << residual_error << " max_error " << residual_error << endl;
255 void MTPGraph::dp_compute_distances() {
260 for(int k = 0; k < _nb_vertices; k++) {
261 _vertices[k].distance_from_source = FLT_MAX;
262 _vertices[k].pred_edge_toward_source = 0;
265 _source->distance_from_source = 0;
267 for(int k = 0; k < _nb_vertices; k++) {
269 for(e = v->leaving_edge_list_root; e; e = e->next_leaving_edge) {
270 d = v->distance_from_source + e->positivized_length;
271 tv = e->terminal_vertex;
272 if(d < tv->distance_from_source) {
273 tv->distance_from_source = d;
274 tv->pred_edge_toward_source = e;
280 // This method does not change the edge occupation. It only sets
281 // properly, for every vertex, the fields distance_from_source and
282 // pred_edge_toward_source.
284 void MTPGraph::find_shortest_path() {
285 Vertex *v, *tv, **last_slot;
289 for(int k = 0; k < _nb_vertices; k++) {
290 _vertices[k].distance_from_source = FLT_MAX;
291 _vertices[k].pred_edge_toward_source = 0;
294 _heap_size = _nb_vertices;
295 _source->distance_from_source = 0;
296 _source->decrease_distance_in_heap(_heap);
299 // Get the closest to the source
302 // Remove it from the heap (swap it with the last_slot in the heap, and
303 // update the distance of that one)
305 last_slot = _heap + _heap_size;
306 swap(*_heap, *last_slot); swap((*_heap)->heap_slot, (*last_slot)->heap_slot);
307 _heap[0]->increase_distance_in_heap(_heap, _heap + _heap_size);
309 // Now update the neighbors of the node currently closest to the
311 for(e = v->leaving_edge_list_root; e; e = e->next_leaving_edge) {
312 d = v->distance_from_source + e->positivized_length;
313 tv = e->terminal_vertex;
314 if(d < tv->distance_from_source) {
315 ASSERT(tv->heap_slot - _heap < _heap_size);
316 tv->distance_from_source = d;
317 tv->pred_edge_toward_source = e;
318 tv->decrease_distance_in_heap(_heap);
321 } while(_heap_size > 0);
324 void MTPGraph::find_best_paths(scalar_t *lengths) {
325 scalar_t shortest_path_length;
329 for(int e = 0; e < _nb_edges; e++) {
330 _edges[e].length = lengths[e];
331 _edges[e].occupied = 0;
332 _edges[e].positivized_length = _edges[e].length;
335 // Compute the distance of all the nodes from the source by just
336 // visiting them in the proper DAG ordering we computed when
337 // building the graph
338 dp_compute_distances();
341 // Use the current distance from the source to make all edge
343 update_positivized_lengths();
344 // Fix numerical errors
345 force_positivized_lengths();
347 find_shortest_path();
349 shortest_path_length = 0.0;
351 // Do we reach the sink?
352 if(_sink->pred_edge_toward_source) {
353 // If yes, compute the length of the best path according to the
354 // original edge lengths
356 while(v->pred_edge_toward_source) {
357 shortest_path_length += v->pred_edge_toward_source->length;
358 v = v->pred_edge_toward_source->origin_vertex;
360 // If that length is negative
361 if(shortest_path_length < 0.0) {
363 cerr << __FILE__ << ": Found a path of length " << shortest_path_length << endl;
365 // Invert all the edges along the best path
367 while(v->pred_edge_toward_source) {
368 e = v->pred_edge_toward_source;
369 v = e->origin_vertex;
371 // This is the only place where we change the occupations of
373 e->occupied = 1 - e->occupied;
378 } while(shortest_path_length < 0.0);
380 // Put back the graph in its original state (i.e. invert edges which
381 // have been inverted in the process)
382 for(int k = 0; k < _nb_edges; k++) {
384 if(e->occupied) { e->invert(); }
388 int MTPGraph::retrieve_one_path(Edge *e, Path *path) {
390 int l = 0, nb_occupied_next;
393 path->nodes[l++] = int(e->origin_vertex - _vertices);
394 path->length = e->length;
397 while(e->terminal_vertex != _sink) {
399 path->nodes[l++] = int(e->terminal_vertex - _vertices);
400 path->length += e->length;
403 nb_occupied_next = 0;
404 for(f = e->terminal_vertex->leaving_edge_list_root; f; f = f->next_leaving_edge) {
405 if(f->occupied) { nb_occupied_next++; next = f; }
409 if(nb_occupied_next == 0) {
410 cerr << __FILE__ << ": retrieve_one_path: Non-sink end point." << endl;
414 else if(nb_occupied_next > 1) {
415 cerr << __FILE__ << ": retrieve_one_path: Non node-disjoint paths." << endl;
424 path->nodes[l++] = int(e->terminal_vertex - _vertices);
425 path->length += e->length;
431 //////////////////////////////////////////////////////////////////////
433 void MTPGraph::compute_dp_ordering() {
438 // This procedure computes for each node the longest link from the
439 // source, and abort if the graph is not a DAG, and order the node
440 // in _dp_order according to that value.
442 int *nb_predecessors = new int[_nb_vertices];
444 Vertex **already_processed = _dp_order, **front = _dp_order, **new_front = _dp_order;
446 for(int k = 0; k < _nb_vertices; k++) {
447 nb_predecessors[k] = 0;
450 for(int k = 0; k < _nb_vertices; k++) {
452 for(e = v->leaving_edge_list_root; e; e = e->next_leaving_edge) {
453 tv = int(e->terminal_vertex - _vertices);
454 nb_predecessors[tv]++;
458 for(int k = 0; k < _nb_vertices; k++) {
459 if(nb_predecessors[k] == 0) {
460 *(front++) = _vertices + k;
465 while(already_processed < front) {
467 while(already_processed < front) {
468 v = *(already_processed++);
469 v->distance_from_source = rank;
470 for(e = v->leaving_edge_list_root; e; e = e->next_leaving_edge) {
471 tv = int(e->terminal_vertex - _vertices);
472 nb_predecessors[tv]--;
473 ASSERT(nb_predecessors[tv] >= 0);
474 if(nb_predecessors[tv] == 0) {
475 *(new_front++) = e->terminal_vertex;
483 if(already_processed < _dp_order + _nb_vertices) {
484 cerr << __FILE__ << ": The graph is not a DAG." << endl;
488 delete[] nb_predecessors;
490 for(int v = 0; v < _nb_vertices; v++) { _dp_order[v] = &_vertices[v]; }
491 qsort(_dp_order, _nb_vertices, sizeof(Vertex *), compare_vertices_on_distance);
494 //////////////////////////////////////////////////////////////////////
496 void MTPGraph::retrieve_disjoint_paths() {
500 for(int p = 0; p < nb_paths; p++) delete paths[p];
504 for(e = _source->leaving_edge_list_root; e; e = e->next_leaving_edge) {
505 if(e->occupied) { nb_paths++; }
508 paths = new Path *[nb_paths];
511 for(e = _source->leaving_edge_list_root; e; e = e->next_leaving_edge) {
513 l = retrieve_one_path(e, 0);
514 paths[p] = new Path(l);
515 retrieve_one_path(e, paths[p]);