Cited by 790Video Surveillance and Tracking MethodsAutonomous Vehicle Technology and SafetyAdvanced Vision and Imaging

Globally-optimal greedy algorithms for tracking a variable number of objects

Pirsiavash, Hamed, Ramanan, Deva, Fowlkes, Charless C.·2011·CVPR 2011

Abstract

We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as well as their birth and death states. We show that the global solution can be obtained with a greedy algorithm that sequentially instantiates tracks using shortest path computations on a flow network. Greedy algorithms allow one to embed pre-processing steps, such as nonmax suppression, within the tracking algorithm. Furthermore, we give a near-optimal algorithm based on dynamic programming which runs in time linear in the number of objects and linear in the sequence length. Our algorithms are fast, simple, and scalable, allowing us to process dense input data. This results in state-of-the-art performance.

Integrity signals

Registry

Crossref · 10.1109/cvpr.2011.5995604

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Pirsiavash, H., Ramanan, D., & Fowlkes, C. C.
Affiliations
University of California, Irvine (US)
Venue
CVPR 2011
Publisher
IEEE
Published
2011-06
Pages
1201-1208
OpenAlex
W2016135469
Cited by
790
References
26
Citations by year
2026: 4 · 2025: 14 · 2024: 17 · 2023: 37 · 2022: 39 · 2021: 59 · 2020: 73 · 2019: 87 · 2018: 95 · 2017: 79 · 2016: 90 · 2015: 81 · 2014: 48 · 2013: 40 · 2012: 22
FWCI
27.44
Type
conference paper
Language
en
Open access
closed
Funders
Office of Naval Research
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Video Surveillance and Tracking Methods
  • Physical Sciences › Engineering › Automotive Engineering › Autonomous Vehicle Technology and Safety
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Vision and Imaging
Keywords
multi-target tracking, video sequences, greedy algorithm, track initialization, flow networks, shortest path, dynamic programming, non-maximum suppression, computational complexity

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