%0 Journal Article
%J IEEE Transactions on Pattern Analysis and Machine Intelligence
%D 2006
%T MCMC Data Association and Sparse Factorization Updating for Real Time Multitarget Tracking with Merged and Multiple Measurements
%A Zia Khan
%A Balch, T.
%A Dellaert, F.
%K algorithms
%K approximate inference
%K Artificial intelligence
%K auxiliary variable particle filter
%K Computational efficiency
%K continuous state space
%K downdating
%K Image Enhancement
%K Image Interpretation, Computer-Assisted
%K Inference algorithms
%K Information Storage and Retrieval
%K laser range scanner
%K laser range scanner.
%K Least squares approximation
%K least squares approximations
%K Least squares methods
%K linear least squares
%K Markov chain Monte Carlo
%K Markov processes
%K MCMC data association
%K merged measurements
%K Monte Carlo methods
%K Movement
%K multiple merged measurements
%K multitarget tracking
%K particle filter
%K particle filtering (numerical methods)
%K Particle filters
%K Pattern Recognition, Automated
%K probabilistic model
%K QR factorization
%K Radar tracking
%K Rao-Blackwellized
%K real time multitarget tracking
%K Reproducibility of results
%K Sampling methods
%K Sensitivity and Specificity
%K sensor fusion
%K sparse factorization updating
%K sparse least squares
%K State-space methods
%K Subtraction Technique
%K target tracking
%K updating
%X In several multitarget tracking applications, a target may return more than one measurement per target and interacting targets may return multiple merged measurements between targets. Existing algorithms for tracking and data association, initially applied to radar tracking, do not adequately address these types of measurements. Here, we introduce a probabilistic model for interacting targets that addresses both types of measurements simultaneously. We provide an algorithm for approximate inference in this model using a Markov chain Monte Carlo (MCMC)-based auxiliary variable particle filter. We Rao-Blackwellize the Markov chain to eliminate sampling over the continuous state space of the targets. A major contribution of this work is the use of sparse least squares updating and downdating techniques, which significantly reduce the computational cost per iteration of the Markov chain. Also, when combined with a simple heuristic, they enable the algorithm to correctly focus computation on interacting targets. We include experimental results on a challenging simulation sequence. We test the accuracy of the algorithm using two sensor modalities, video, and laser range data. We also show the algorithm exhibits real time performance on a conventional PC
%B IEEE Transactions on Pattern Analysis and Machine Intelligence
%V 28
%P 1960 - 1972
%8 2006/12//
%@ 0162-8828
%G eng
%N 12