Carmi, A and Septier, F and Godsill, SJ (2012) The Gaussian mixture MCMC particle algorithm for dynamic cluster tracking. Automatica, 48. pp. 2454-2467. ISSN 0005-1098Full text not available from this repository.
We present a novel filtering algorithm for tracking multiple clusters of coordinated objects. 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. For handling complex, possibly large scale scenarios, the sampling efficiency of the basic MCMC scheme is enhanced via the use of a Metropolis within Gibbs particle refinement step. As the proposed methodology essentially involves random set representations, a new type of estimator, termed the probability hypothesis density surface (PHDS), is derived for computing point estimates. It is further proved that this estimator is optimal in the sense of the mean relative entropy. Finally, the algorithm's performance is assessed and demonstrated in both synthetic and realistic tracking scenarios. © 2012 Elsevier Ltd. All rights reserved.
|Divisions:||Div F > Signal Processing and Communications|
|Depositing User:||Unnamed user with email email@example.com|
|Date Deposited:||02 Sep 2016 16:48|
|Last Modified:||26 Sep 2016 01:25|