Markov Chain Monte Carlo Data Association for Multi-Target Tracking
The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Abstract
This paper presents Markov chain Monte Carlo data association (MCMCDA) for solving data association problems arising in multitarget tracking in a cluttered environment. When the number of targets is fixed, the single-scan version of MCMCDA approximates joint probabilistic data association (JPDA). Although the exact computation of association probabilities in JPDA is NP-hard, we prove that the single-scan MCMCDA algorithm provides a fully polynomial randomized approximation scheme for JPDA. For general multitarget tracking problems, in which unknown numbers of targets appear and disappear at random times, we present a multi-scan MCMCDA algorithm that approximates the optimal Bayesian filter. We also present extensive simulation studies supporting theoretical results in this paper. Our simulation results also show that MCMCDA outperforms multiple hypothesis tracking (MHT) by a significant margin in terms of accuracy and efficiency under extreme conditions, such as a large number of targets in a dense environment, low detection probabilities, and high false alarm rates.
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“The MCMC method includes algorithms such as Gibbs sampling [31] and the Metropolis-Hastings algorithm [32], [33].”
MethodAdvances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Sequential Monte Carlo Methods in Practice
(2001) · Springer eBooks · doi:10.1007/978-1-4757-3437-9 · Cited by 7,366
Unscented Filtering and Nonlinear Estimation
Julier, S. J., & Uhlmann, J. K. (2004) · Proceedings of the IEEE · doi:10.1109/jproc.2003.823141 · Cited by 6,588
Bar‐Shalom, Y. (1988) · Medical Entomology and Zoology · Cited by 3,157
Bar-Shalom, Y., Fortmann, T. E., & Cable, P. G. (1990) · The Journal of the Acoustical Society of America · doi:10.1121/1.398863 · Cited by 3,070
An algorithm for tracking multiple targets
Reid, D. (1979) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1979.1102177 · Cited by 3,059
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705 · cited 1×
“The exact calculation of association probabilities in JPDA, which requires the summation over all association event probabilities, is NP-hard [12] since the related problem of finding the permanent of a matrix is #P-complete1 [14].”
BackgroundThe interacting multiple model algorithm for systems with Markovian switching coefficients
Blom, H. A. P., & Bar-Shalom, Y. (1988) · IEEE Transactions on Automatic Control · doi:10.1109/9.1299 · Cited by 2,460
Multitarget bayes filtering via first-order multitarget moments
Mahler, R. P. S. (2003) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2003.1261119 · Cited by 2,235
Markov Chain Monte Carlo in Practice.
Kass, R. E., Gilks, W. R., Richardson, S., & Spiegelhalter, D. J. (1997) · Journal of the American Statistical Association · doi:10.2307/2965438 · Cited by 1,380
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1007/978-1-4899-4485-6 · Cited by 1,151
Efficient clustering of high-dimensional data sets with application to reference matching
McCallum, A., Nigam, K., & Ungar, L. H. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347123 · Cited by 1,096
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Cox, I. J., & Hingorani, S. L. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.481539 · Cited by 665 · cited 1×
“Various heuristic methods have been developed to control this growth [7], [9], [10]; but these methods sacrifice the MAP property.”
MethodThe Markov chain Monte Carlo method: an approach to approximate counting and integration
Jerrum, M., & Sinclair, A. (1996) · PWS Publishing Co. eBooks · Cited by 592
Polynomial-Time Approximation Algorithms for the Ising Model
Jerrum, M., & Sinclair, A. (1993) · SIAM Journal on Computing · doi:10.1137/0222066 · Cited by 548
MCMC Analysis of Diffusion Models With Application to Finance
Eraker, B. (2001) · Journal of Business & Economic Statistics · doi:10.1198/073500101316970403 · Cited by 394
Schulz, D., Burgard, W., Fox, D., & Cremers, A. B. (2002) · Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164) · doi:10.1109/robot.2001.932850 · Cited by 370
Approximations to optimal nonlinear filters
Kushner, H. J. (1967) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1967.1098671 · Cited by 356
A review of statistical data association techniques for motion correspondence
Cox, I. J. (1993) · International Journal of Computer Vision · doi:10.1007/bf01440847 · Cited by 346
Markov chain concepts related to sampling algorithms
(1995) · Markov Chain Monte Carlo in Practice · doi:10.1201/b14835-8 · Cited by 311
Information retrieval: the role of equipment and an assessment of the technology
Berul, L. H. (2024) · doi:10.17918/00005341 · Cited by 289
Application of 0-1 integer programming to multitarget tracking problems
Morefield, C. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101500 · Cited by 281
Identity Uncertainty and Citation Matching
Pasula, H., Marthi, B., Milch, B., Russell, S., & Shpitser, I. (2002) · Cited by 276
Self-citationMarkov chain Monte Carlo data association for general multiple-target tracking problems
Oh, S., Russell, S., & Sastry, S. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1428740 · Cited by 241
Self-citationAn Optimal Data Association Problem in Surveillance Theory
Sittler, R. W. (1964) · IEEE Transactions on Military Electronics · doi:10.1109/tme.1964.4323129 · Cited by 208
Maximum likelihood method for probabilistic multihypothesis tracking:
Streit, R. L., & Luginbuhl, T. E. (1994) · SPIE Proceedings · doi:10.1117/12.179066 · Cited by 204
Development of Practical PDA Logic for Multitarget Tracking by Microprocessor
Fitzgerald, R. J. (1986) · 1986 American Control Conference · doi:10.23919/acc.1986.4789059 · Cited by 179
Tracking many objects with many sensors
Pasula, H., Russell, S., Ostland, M., & Ritov, Y. (1999) · Cited by 165
Self-citationBeichl, I., & Sullivan, F. (2000) · Computing in Science & Engineering · doi:10.1109/5992.814660 · Cited by 163
Oh, S., Schenato, L., Chen, P. W.-C., & Sastry, S. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887296 · Cited by 144
Self-citationA class of near optimal JPDA algorithms
Roecker, J. A. (1994) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.272272 · Cited by 121
Efficient gating in data association with multivariate Gaussian distributed states
Collins, J. B., & Uhlmann, J. K. (1992) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.256316 · Cited by 109
EM, MCMC, and Chain Flipping for Structure from Motion with Unknown Correspondence
Dellaert, F., Seitz, S. M., Thorpe, C., & Thrun, S. (2003) · Machine Learning · doi:10.1023/a:1020245811187 · Cited by 96
Multisensor multitarget mixture reduction algorithms for tracking
Pao, L. Y. (1994) · Journal of Guidance Control and Dynamics · doi:10.2514/3.21334 · Cited by 70
Markov chain Monte Carlo data association for target tracking
Bergman, N., & Arnaud Doucet, B. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2000.859057 · Cited by 47
Gaughan, G., Fitzgerald, B. F., & Shaikh, M. (2009) · Euromicro Conference on Software Engineering and Advanced Applications (SEAA) · doi:10.1109/seaa.2009.86 · Cited by 33
An overview of process query systems
Cybenko, G. V., Berk, V. H., Crespi, V., Jiang, G., & Gray, R. S. (2004) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.568330 · Cited by 31
A polynomial-time approximation algorithm for joint probabilistic data association
Oh, S., & Sastry, S. (2005) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2005.1470141 · Cited by 29
Self-citation
Cited by
Learning to Track: Online Multi-object Tracking by Decision Making
Xiang, Y., Alahi, A., & Savarese, S. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.534 · Cited by 674
Multiple Hypothesis Tracking Revisited
Kim, C., Li, F., Ciptadi, A., & Rehg, J. M. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.533 · Cited by 666
“MHT was known to be sensitive to its parameter settings [32].”
BackgroundContinuous 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
Chu, Q., Ouyang, W., Li, H., Wang, X., Liu, B., & Yu, N. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.518 · Cited by 406
Message Passing Algorithms for Scalable Multitarget Tracking
Meyer, F., Kropfreiter, T., Williams, J. L., Lau, R., Hlawatsch, F., Braca, P., & Win, M. Z. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2789427 · Cited by 355
Metadata
- Authors
- Oh, S., Russell, S., & Sastry, S.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2009-03
- Volume
- 54
- Issue
- 3
- Pages
- 481-497
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2127021804
- Cited by
- 336
- References
- 44
- FWCI
- 14.82
- Type
- journal article
- 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.