Skip to Main content Skip to Navigation
Conference papers

Multiple Object Tracking by Efficient Graph Partitioning

Ratnesh Kumar 1 Guillaume Charpiat 1 Monique Thonnat 1
1 STARS - Spatio-Temporal Activity Recognition Systems
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In this paper, we view multiple object tracking as a graphpartitioning problem. Given any object detector, we build the graph ofall detections and aim to partition it into trajectories. To quantifythe similarity of any two detections, we consider local cues such as pointtracks and speed, global cues such as appearance, as well as intermediateones such as trajectory straightness. These different clues are dealt jointlyto make the approach robust to detection mistakes (missing or extradetections). We thus define a Conditional Random Field and optimizeit using an efficient combination of message passing and move-makingalgorithms. Our approach is fast on video batch sizes of hundreds offrames. Competitive and stable results on varied videos demonstrate the robustnessand efficiency of our approach.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-01061450
Contributor : Guillaume Charpiat <>
Submitted on : Wednesday, November 19, 2014 - 5:13:23 PM
Last modification on : Thursday, March 5, 2020 - 5:34:15 PM
Document(s) archivé(s) le : Friday, February 20, 2015 - 11:10:45 AM

File

ACCV2014_Tracking.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial 4.0 International License

Identifiers

  • HAL Id : hal-01061450, version 1

Collections

Citation

Ratnesh Kumar, Guillaume Charpiat, Monique Thonnat. Multiple Object Tracking by Efficient Graph Partitioning. ACCV - 12th Asian Conference on Computer Vision, Michael S. Brown and Tat-Jen Cham and Yasuyuki Matsushita, Nov 2014, Singapore, Singapore. ⟨hal-01061450⟩

Share

Metrics

Record views

509

Files downloads

428