Branch-and-price global optimization for multi-view multi-target tracking
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
We present a new algorithm to jointly track multiple objects in multi-view images. While this has been typically addressed separately in the past, we tackle the problem as a single global optimization. We formulate this assignment problem as a min-cost problem by defining a graph structure that captures both temporal correlations between objects as well as spatial correlations enforced by the configuration of the cameras. This leads to a complex combinatorial optimization problem that we solve using Dantzig-Wolfe decomposition and branching. Our formulation allows us to solve the problem of reconstruction and tracking in a single step by taking all available evidence into account. In several experiments on multiple people tracking and 3D human pose tracking, we show our method outperforms state-of-the-art approaches.
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
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219 · cited 1×
“The combination of column generation and branchand-bound methods is known as branch-and-price [2].”
BackgroundMultiple Object Tracking Using K-Shortest Paths Optimization
Berclaz, J., Fleuret, F., Turetken, E., & Fua, P. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.21 · Cited by 1,015
Globally-optimal greedy algorithms for tracking a variable number of objects
Pirsiavash, H., Ramanan, D., & Fowlkes, C. C. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995604 · Cited by 790
Multiple Target Tracking Using Spatio-Temporal Markov Chain Monte Carlo Data Association
Yu, Q., Medioni, G., & Cohen, I. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.382991 · Cited by 132 · cited 1×
“In [24], the assignments are found using a data-driven MCMC approach, while [23] presented a formulation with two separate optimization problems: linking across-time is solved using networks flows and linking across-views is solved using set-cover techniques.”
Method
Cited by
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
Tracking Without Bells and Whistles
Bergmann, P., Meinhardt, T., & Leal-Taixe, L. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00103 · Cited by 1,110
Multiple 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
Learning a Neural Solver for Multiple Object Tracking
Braso, G., & Leal-Taixe, L. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00628 · Cited by 504
Learning an Image-Based Motion Context for Multiple People Tracking
Leal-Taixe, L., Fenzi, M., Kuznetsova, A., Rosenhahn, B., & Savarese, S. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.453 · Cited by 280
Self-citationMulti-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
- Leal-Taixe, L., Pons-Moll, G., & Rosenhahn, B.
- Venue
- 2012 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2012-06
- Pages
- 1987-1994
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2135841119
- Cited by
- 85
- References
- 4
- FWCI
- 5.47
- 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.