The Gaussian mixture MCMC particle algorithm for dynamic cluster tracking

Abstract : We present a new filtering algorithm for tracking multiple clusters of coordinated targets. Based on a Markov Chain Monte Carlo (MCMC) mechanism, the new algorithm propagates a discrete approximation of the underlying filtering density. A dynamic Gaussian mixture model is utilized for representing the time-varying clustering structure. This involves point process formulations of typical behavioral moves such as birth and death of clusters as well as merging and splitting. Following our previous work, we adopt here two strategies for increasing the sampling efficiency of the basic MCMC scheme: an evolutionary stage which allows improved exploration of the sample space, and an EM-based method for making optimized proposals based on the frame likelihood. The algorithm's performance is assessed and demonstrated in both synthetic and real tracking scenarios.
Complete list of metadatas
Contributor : François Septier <>
Submitted on : Monday, April 15, 2013 - 11:40:00 AM
Last modification on : Tuesday, April 16, 2013 - 2:06:50 PM
Long-term archiving on : Tuesday, July 16, 2013 - 2:30:10 AM


Files produced by the author(s)


  • HAL Id : hal-00566634, version 1



Avishy Carmi, François Septier, Simon Godsill. The Gaussian mixture MCMC particle algorithm for dynamic cluster tracking. 12th International Conference on Information Fusion, 2009. FUSION '09., Jul 2009, Seattle, WA, United States. pp.1179-1186. ⟨hal-00566634⟩



Record views


Files downloads