loading...
Boosted Markov Chain Monte Carlo Data Association for Multiple Target Detection and Tracking
Hong Kong August 20-August 24
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.33618th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Qian Yu, University of Southern California
Isaac Cohen, University of Southern California
Gerard Medioni, University of Southern California
Bo Wu, University of Southern California
In this paper, we present a probabilistic framework for automatic detection and tracking of objects. We address the data association problem by formulating the visual tracking as finding the best partition of a measurement graph containing all detected moving regions. In order to incorporate model information in tracking procedure, the posterior distribution is augmented with Adaboost image likelihood. We adopt a MRF-based interaction to model the inter-track exclusion. To avoid the exponential complexity, we apply Markov Chain Monte Carlo (MCMC) method to sample the solution space efficiently. We take data-oriented sampling driven by an informed proposal scheme controlled by a joint probability model combining motion, appearance and interaction among detected regions. Proposed data association method is robust and efficient, capable of handling extreme conditions with very noisy detection.
Citation:
Qian Yu, Isaac Cohen, Gerard Medioni, Bo Wu, "Boosted Markov Chain Monte Carlo Data Association for Multiple Target Detection and Tracking," icpr, vol. 2, pp.675-678, 18th International Conference on Pattern Recognition (ICPR'06) Volume 2, 2006
Usage of this product signifies your acceptance of the Terms of Use.