Globally optimal solution to multi-object tracking with merged measurements
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Multiple object tracking has been formulated recently as a global optimization problem, and solved efficiently with optimal methods such as the Hungarian Algorithm. A severe limitation is the inability to model multiple objects that are merged into a single measurement, and track them as a group, while retaining optimality. This work presents a new graph structure that encodes these multiple-match events as standard one-to-one matches, allowing computation of the solution in polynomial time. Since identities are lost when objects merge, an efficient method to identify groups is also presented, as a flow circulation problem. The problem of tracking individual objects across groups is then posed as a standard optimal assignment. Experiments show increased performance on the PETS 2006 and 2009 datasets compared to state-of-the-art algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
CONDENSATION—Conditional Density Propagation for Visual Tracking
Isard, M., & Blake, A. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008078328650 · Cited by 4,886 · cited 1×
“A great research effort has been dedicated to following a single object by keeping a model of low-level features and searching for its new location in each frame [16, 10, 19].”
BackgroundAn experimental comparison of min-cut/max- flow algorithms for energy minimization in vision
Boykov, Y., & Kolmogorov, V. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.60 · Cited by 4,577
An algorithm for tracking multiple targets
Reid, D. (1979) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1979.1102177 · Cited by 3,059
Cited by
Exploiting the Circulant Structure of Tracking-by-Detection with Kernels
Henriques, J. F., Caseiro, R., Martins, P., & Batista, J. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33765-9_50 · Cited by 2,310
Self-citationVisual Tracking: An Experimental Survey
(2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.230 · Cited by 1,513
MOT16: A Benchmark for Multi-Object Tracking
Milan, A., Leal-Taixe, L., Reid, I., Roth, S., & Schindler, K. (2016) · arXiv · doi:10.48550/arxiv.1603.00831 · Cited by 1,309
“The easiest sequence for tracking (S2L1) consisted of a scene with few pedestrians, and for that sequence state-of-the-art methods perform extremely well with accuracies of over 90% given a good set of initial detections [23], [33], [47].”
BackgroundMultiple object tracking: A literature review
Luo, W., Xing, J., Milan, A., Zhang, X., Liu, W., & Kim, T.-K. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2020.103448 · Cited by 1,099
MOTChallenge 2015: Towards a Benchmark for Multi-Target Tracking
Leal-Taixé, L., Milan, A., Reid, I. D., Roth, S., & Schindler, K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.01942 · Cited by 743
Continuous Energy Minimization for Multitarget Tracking
Milan, A., Roth, S., & Schindler, K. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.103 · Cited by 565
MOTChallenge: A Benchmark for Single-Camera Multiple Target Tracking
Dendorfer, P., Os̆ep, A., Milan, A., Schindler, K., Cremers, D., Reid, I., Roth, S., & Leal-Taixé, L. (2021) · International Journal of Computer Vision · doi:10.1007/s11263-020-01393-0 · Cited by 374
“or tracking (S2L1) consists of a scene with few pedestrians, and for that sequence, state-of-the-art methods perform extremely well with accuracies of over 90% given a good set of initial detections [Henriques et al., 2011, Milan et al., 2014, Zamir et al., 2012]. Therefore, methods started to focus on tracking object…”
BackgroundGMCP-Tracker: Global Multi-object Tracking Using Generalized Minimum Clique Graphs
Roshan Zamir, A., Dehghan, A., & Shah, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33709-3_25 · Cited by 353
Multi-Commodity Network Flow for Tracking Multiple People
Shitrit, H. B., Berclaz, J., Fleuret, F., & Fua, P. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.210 · Cited by 172
“In this section, we first review generic approaches to multiple target tracking and then briefly discuss those that are specifically designed to track multiple players in team sports.”
Background
Metadata
- Authors
- Henriques, J. F., Caseiro, R., & Batista, J.
- Venue
- 2011 International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2011-11
- Pages
- 2470-2477
- OpenAlex
- W2121332494
- Cited by
- 129
- References
- 4
- FWCI
- 9.33
- Type
- conference paper
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.