The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
GMMCP tracker: Globally optimal Generalized Maximum Multi Clique problem for multiple object tracking
Open accessAbstract
Data association is the backbone to many multiple object tracking (MOT) methods. In this paper we formulate data association as a Generalized Maximum Multi Clique problem (GMMCP). We show that this is the ideal case of modeling tracking in real world scenario where all the pairwise relationships between targets in a batch of frames are taken into account. Previous works assume simplified version of our tracker either in problem formulation or problem optimization. However, we propose a solution using GMMCP where no simplification is assumed in either steps. We show that the NP hard problem of GMMCP can be formulated through Binary-Integer Program where for small and medium size MOT problems the solution can be found efficiently. We further propose a speed-up method, employing Aggregated Dummy Nodes for modeling occlusion and miss-detection, which reduces the size of the input graph without using any heuristics. We show that, using the speedup method, our tracker lends itself to real-time implementation which is plausible in many applications. We evaluated our tracker on six challenging sequences of Town Center, TUD-Crossing, TUD-Stadtmitte, Parking-lot 1, Parking-lot 2 and Parking-lot pizza and show favorable improvement against state of art.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Object Detection with Discriminatively Trained Part-Based Models
Felzenszwalb, P. F., Girshick, R. B., McAllester, D., & Ramanan, D. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.167 · Cited by 9,853
European journal of operational research
(1990) · Technological Forecasting and Social Change · doi:10.1016/0040-1625(90)90023-o · Cited by 5,365
Multiple 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
Global data association for multi-object tracking using network flows
Zhang, L., Li, Y., & Nevatia, R. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587584 · Cited by 925
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
Stable multi-target tracking in real-time surveillance video
Benfold, B., & Reid, I. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995667 · Cited by 651
Online Multiperson Tracking-by-Detection from a Single, Uncalibrated Camera
Breitenstein, M. D., Reichlin, F., Leibe, B., Koller-Meier, E., & Van Gool, L. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.232 · Cited by 579
Bae, S.-H., & Yoon, K.-J. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.159 · Cited by 410
GMCP-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
Self-citationDiscrete-continuous optimization for multi-target tracking
Andriyenko, A., Schindler, K., & Roth, S. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247893 · Cited by 336
Cited by
Re-ranking Person Re-identification with k-Reciprocal Encoding
Zhong, Z., Zheng, L., Cao, D., & Li, S. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.389 · Cited by 1,583
MARS: A Video Benchmark for Large-Scale Person Re-Identification
Zheng, L., Bie, Z., Sun, Y., Wang, J., Su, C., Wang, S., & Tian, Q. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46466-4_52 · Cited by 965
Person Re-identification: Past, Present and Future
Zheng, L., Yang, Y. P., & Hauptmann, A. G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1610.02984 · Cited by 922
UA-DETRAC: A New Benchmark and Protocol for Multi-Object Detection and Tracking
Wen, L., Du, D., Cai, Z., Lei, Z., Chang, M.-C., Qi, H., Lim, J., Yang, M.-H., & Lyu, S. (2020) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2020.102907 · Cited by 804
Mask-Guided Contrastive Attention Model for Person Re-identification
Song, C., Huang, Y., Ouyang, W., & Wang, L. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00129 · Cited by 653
Metadata
- Authors
- Dehghan, A., Assari, S. M., & Shah, M.
- Venue
- 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
- Publisher
- IEEE
- Published
- 2015-06
- Pages
- 4091-4099
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1932380673
- Cited by
- 312
- References
- 23
- FWCI
- 15.38
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: GMMCP tracker: Globally optimal Generalized Maximum Multi Clique problem for multiple object tracking. https://app.cochat.ai/papers/10.1109/cvpr.2015.7299036
- The paper
- Dehghan, A., Assari, S. M., & Shah, M. (2015). GMMCP tracker: Globally optimal Generalized Maximum Multi Clique problem for multiple object tracking. 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). https://doi.org/10.1109/cvpr.2015.7299036
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.