The Community for Technology Leaders
Green Image
Issue No. 12 - December (2009 vol. 31)
ISSN: 0162-8828
pp: 2196-2210
Qian Yu , University of Southern California, Los Angeles
Gérard Medioni , University of Southern California, Los Angeles
We propose a framework for tracking multiple targets, where the input is a set of candidate regions in each frame, as obtained from a state-of-the-art background segmentation module, and the goal is to recover trajectories of targets over time. Due to occlusions by targets and static objects, as also by noisy segmentation and false alarms, one foreground region may not correspond to one target faithfully. Therefore, the one-to-one assumption used in most data association algorithms is not always satisfied. Our method overcomes the one-to-one assumption by formulating the visual tracking problem in terms of finding the best spatial and temporal association of observations, which maximizes the consistency of both motion and appearance of trajectories. To avoid enumerating all possible solutions, we take a Data-Driven Markov Chain Monte Carlo (DD-MCMC) approach to sample the solution space efficiently. The sampling is driven by an informed proposal scheme controlled by a joint probability model combining motion and appearance. Comparative experiments with quantitative evaluations are provided.
Multiple-target tracking, data association, MCMC, visual surveillance.

G. Medioni and Q. Yu, "Multiple-Target Tracking by Spatiotemporal Monte Carlo Markov Chain Data Association," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 31, no. , pp. 2196-2210, 2008.
97 ms
(Ver 3.3 (11022016))