Markov chain Monte Carlo data association for general multiple-target tracking problems
Authors:
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (01912216) , 735-742 Vol.1
Abstract
In this paper, we consider the general multiple-target tracking problem in which an unknown number of targets appears and disappears at random times and the goal is to find the tracks of targets from noisy observations. We propose an efficient real-time algorithm that solves the data association problem and is capable of initiating and terminating a varying number of tracks. We take the data-oriented, combinatorial optimization approach to the data association problem but avoid the enumeration of tracks by applying a sampling method called Markov chain Monte Carlo (MCMC). The MCMC data association algorithm can be viewed as a "deferred logic" method since its decision about forming a track is based on both current and past observations. At the same time, it can be viewed as an approximation to the optimal Bayesian filter. The algorithm shows remarkable performance compared to the greedy algorithm and the multiple hypothesis tracker (MHT) under extreme conditions, such as a large number of targets in a dense environment, low detection probabilities, and high false alarm rates.Keywords
This publication has 13 references indexed in Scilit:
- An efficient implementation of Reid's multiple hypothesis tracking algorithm and its evaluation for the purpose of visual trackingIEEE Transactions on Pattern Analysis and Machine Intelligence, 1996
- Multidimensional assignments and multitarget tracking1995
- Multisensor multitarget mixture reduction algorithms for trackingJournal of Guidance, Control, and Dynamics, 1994
- Maximum likelihood method for probabilistic multihypothesis tracking1994
- A review of statistical data association techniques for motion correspondenceInternational Journal of Computer Vision, 1993
- Efficient gating in data association with multivariate Gaussian distributed statesIEEE Transactions on Aerospace and Electronic Systems, 1992
- An algorithm for tracking multiple targetsIEEE Transactions on Automatic Control, 1979
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Application of 0-1 integer programming to multitarget tracking problemsIEEE Transactions on Automatic Control, 1977
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing CostOperations Research, 1968