Cited by 1,015Video Surveillance and Tracking MethodsTarget Tracking and Data Fusion in Sensor NetworksAutonomous Vehicle Technology and Safety

Multiple Object Tracking Using K-Shortest Paths Optimization

Open access
Berclaz, J., Fleuret, F., Turetken, E., Fua, P.·2011·IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

Multi-object tracking can be achieved by detecting objects in individual frames and then linking detections across frames. Such an approach can be made very robust to the occasional detection failure: If an object is not detected in a frame but is in previous and following ones, a correct trajectory will nevertheless be produced. By contrast, a false-positive detection in a few frames will be ignored. However, when dealing with a multiple target problem, the linking step results in a difficult optimization problem in the space of all possible families of trajectories. This is usually dealt with by sampling or greedy search based on variants of Dynamic Programming which can easily miss the global optimum. In this paper, we show that reformulating that step as a constrained flow optimization results in a convex problem. We take advantage of its particular structure to solve it using the k-shortest paths algorithm, which is very fast. This new approach is far simpler formally and algorithmically than existing techniques and lets us demonstrate excellent performance in two very different contexts.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpami.2011.21

Cites

53 of 53 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. [37][37] A. Ellis, A. Shahrokni, and J. Ferryman, 'Pets 2009 and winterpets 2009 results: A combined evaluation,' in Twelfth IEEE International Workshop on Performance Evaluation of Tracking and Surveillance , Snowbird, December 2009. -
  2. [39][39] 'Eleventh ieee international workshop on performance evaluation of tracking and surveillance,' http://pets2009.net. -
  3. [43][43] A. Ghouila-Houri, 'Caract´ erisation Des Matrices Totalement Unimodulaires,' Comptes Rendus Hebdomadaires des S´ eances de l'Acad´ emie des Sciences , vol. 254, pp. 1192-1194, 1962. -

Cited by

Sorted by citations

Authors
Berclaz, J., Fleuret, F., Turetken, E., & Fua, P.
Affiliations
  • École Polytechnique Fédérale de Lausanne (CH)
  • Idiap Research Institute (CH)
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2011-09
Volume
33
Issue
9
Pages
1806-1819
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
OpenAlex
W2171243491
Cited by
1,015
References
53
Citations by year
2026: 15 · 2025: 34 · 2024: 44 · 2023: 47 · 2022: 39 · 2021: 63 · 2020: 74 · 2019: 81 · 2018: 92 · 2017: 102 · 2016: 110 · 2015: 118 · 2014: 84 · 2013: 71 · 2012: 36
FWCI
67.45
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
  • PubMed (publishedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion)
Funders
  • University of Reading
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Video Surveillance and Tracking Methods
  • Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
  • Physical Sciences › Engineering › Automotive Engineering › Autonomous Vehicle Technology and Safety
Keywords
multi-target tracking, k-shortest paths, convex optimization, data association, false positive detection, dynamic programming

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review