Markov Chain Monte Carlo Data Association for Multi-Target Tracking

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.

[1]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[2]  Robert W. Sittler,et al.  An Optimal Data Association Problem in Surveillance Theory , 1964, IEEE Transactions on Military Electronics.

[3]  H. Kushner.  Approximations to optimal nonlinear filters , 1967, IEEE Transactions on Automatic Control.

[4]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[5]  C. Morefield.  Application of 0-1 integer programming to multitarget tracking problems , 1977 .

[6]  D. Reid.  An algorithm for tracking multiple targets , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[7]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Robert J. Fitzgerald,et al.  Development of Practical PDA Logic for Multitarget Tracking by Microprocessor , 1986, 1986 American Control Conference.

[11]  Y. Bar-Shalom,et al.  The interacting multiple model algorithm for systems with Markovian switching coefficients , 1988 .

[12]  Y. Bar-Shalom.  Tracking and data association , 1988 .

[13]  P. Diaconis,et al.  Geometric Bounds for Eigenvalues of Markov Chains , 1991 .

[14]  J. B. Collins,et al.  Efficient gating in data association with multivariate Gaussian distributed states , 1992 .

[15]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[16]  J. A. Roecker,et al.  Suboptimal joint probabilistic data association , 1993 .

[17]  Aubrey B. Poore,et al.  Multidimensional Assignments and Multitarget Tracking , 1993, Partitioning Data Sets.

[18]  J. A. Roecker.  A class of near optimal JPDA algorithms , 1994 .

[19]  Roy L. Streit,et al.  Maximum likelihood method for probabilistic multihypothesis tracking , 1994, Defense, Security, and Sensing.

[20]  Lucy Y. Pao,et al.  Multisensor multitarget mixture reduction algorithms for tracking , 1994 .

[21]  Sylvia Richardson,et al.  Markov chain concepts related to sampling algorithms , 1995 .

[22]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[23]  Ingemar J. Cox,et al.  An Efficient Implementation of Reid's Multiple Hypothesis Tracking Algorithm and Its Evaluation for the Purpose of Visual Tracking , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Sylvia Richardson,et al.  Markov Chain Monte Carlo in Practice , 1997 .

[25]  Stuart J. Russell,et al.  Object identification in a Bayesian context , 1997, IJCAI 1997.

[26]  Yaacov Ritov,et al.  Tracking Many Objects with Many Sensors , 1999, IJCAI.

[27]  Arnaud Doucet,et al.  Markov chain Monte Carlo data association for target tracking , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[28]  Andrew McCallum,et al.  Efficient clustering of high-dimensional data sets with application to reference matching , 2000, KDD '00.

[29]  R. Mahler.  A Theoretical Foundation for the Stein-Winter "Probability Hypothesis Density (PHD)" Multitarget Tracking Approach , 2000 .

[30]  Francis Sullivan,et al.  The Metropolis Algorithm , 2000, Computing in Science & Engineering.

[31]  Wolfram Burgard,et al.  Tracking multiple moving targets with a mobile robot using particle filters and statistical data association , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[32]  Bjørn Eraker.  MCMC Analysis of Diffusion Models With Application to Finance , 2001 .

[33]  Nando de Freitas,et al.  Sequential Monte Carlo Methods in Practice , 2001, Statistics for Engineering and Information Science.

[34]  Yuval Peres,et al.  Decayed MCMC iltering , 2002, UAI 2002.

[35]  Stuart J. Russell,et al.  Identity Uncertainty and Citation Matching , 2002, NIPS.

[36]  Yuval Peres,et al.  Decayed MCMC Filtering , 2012, UAI.

[37]  R. Mahler.  Multitarget Bayes filtering via first-order multitarget moments , 2003 .

[38]  Timothy J. Robinson,et al.  Sequential Monte Carlo Methods in Practice , 2003 .

[39]  Mikhail Bilenko and Raymond J. Mooney,et al.  On Evaluation and Training-Set Construction for Duplicate Detection , 2003 .

[40]  L. Hong,et al.  Markov-chain Monte-Carlo approach for association probability evaluation , 2004 .

[41]  Jeffrey K. Uhlmann,et al.  Unscented filtering and nonlinear estimation , 2004, Proceedings of the IEEE.

[42]  Vincent H. Berk,et al.  An overview of process query systems , 2004, SPIE Defense + Commercial Sensing.

[43]  Songhwai Oh,et al.  Markov chain Monte Carlo data association for general multiple-target tracking problems , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[44]  Frank Dellaert,et al.  EM, MCMC, and Chain Flipping for Structure from Motion with Unknown Correspondence , 2004, Machine Learning.

[45]  Ingemar J. Cox,et al.  A review of statistical data association techniques for motion correspondence , 1993, International Journal of Computer Vision.

[46]  S. Sastry,et al.  A polynomial-time approximation algorithm for joint probabilistic data association , 2005, Proceedings of the 2005, American Control Conference, 2005..

[47]  S. Shankar Sastry,et al.  Tracking and Coordination of Multiple Agents Using Sensor Networks: System Design, Algorithms and Experiments , 2007, Proceedings of the IEEE.

[48]  Brian Fitzgerald,et al.  An Examination of the Use of Open Source Software Processes as a Global Software Development Solution for Commercial Software Engineering , 2009, 2009 35th Euromicro Conference on Software Engineering and Advanced Applications.

[49]  S. Russell.  Identity Uncertainty , 2010, Encyclopedia of Machine Learning.