1 February 2016 in IET Radar, Sonar & Navigation
It has been shown that the cardinality balanced multi‐target multi‐Bernoulli (CBMeMBer) filter can extract multi‐target states efficiently and reliably. However, when faced with extended targets, it will lead to overestimation. Therefore, a CBMeMBer filter for extended targets tracking is proposed in this study. Three main contributions are made in this study: first, analytical recursion equations of the proposed CBMeMBer filter are derived and relevant proofs are presented. Second, a novel sequential Monte Carlo (SMC) implementation is proposed, which approximates the sample point using several σ points rather than state transition function. Third, to reduce the particle weight degeneracy problem, a new resample method is introduced. Finally, comparisons between the CBMeMBer and probability hypothesis density (PHD) filters for extended targets tracking are studied through a non‐linear example. Numerical study results show that the expanded CBMeMBer filter in the proposed SMC implementation can dramatically improve estimation accuracy in comparison with general SMC implementation. Meanwhile, the authors also find that the proposed CBMeMBer filter gives a more accurate estimation than original CBMeMBer filter while performs more time‐efficiently than PHD filter for extended target tracking.
25 February 2012 in Science China Information Sciences
20 May 2010 in Acta Automatica Sinica
This paper proposes to track the partly resolvable groups using sequential Monte Carlo probability hypothesis density filter (SMC-PHDF).The estimate of the number and the states of the groups,rather than the individuals,are directly derived by the algorithm.The states of a group here consist of their centroid states and shapes.In order to estimate the number and the states of the groups,the proposed algorithm fits the distribution of the resampled particles of the SMC-PHDF via Gaussian mixture models (GMM),whose component number and parameters correspond to the number and the states of the groups.Expectation maximum (EM) and Markov chain Monte Carlo (MCMC) algorithms are respectively used to estimate the parameters of the mixture.The component number of the mixture is derived by the strategy of pruning,merging and splitting.100 Monte Carlo (MC) simulations show that the proposed approach can track the partly resolvable groups effectively.Besides,the MCMC algorithm outperforms the EM algorithm significantly in extracting the number and the states of the groups,although its computational requirement is larger than the EM algorithm.
1 January 2015 in Digital Signal Processing
1 January 2012 in Acta Automatica Sinica
7 August 2009 in Acta Automatica Sinica
A novel multitarget tracking algorithm in unknown clutter is proposed in this paper.In the proposed algorithm,the multitarget likelihood function is described based on the finite mixture model(FMM),whose parameters are estimated according to the algorithm of expectation maximum(EM)and the technology of model merging and pruning. The estimation of clutter model,target number,and multitarget states can be derived based on the estimated parameters. Similar to the multitarget tracking algorithms based on random finite set(RFS),the association process between the targets and measurements can be avoided in the algorithm proposed.The simulation shows that the estimation results of the proposed algorithm are much better than those of the multitarget tracking algorithms without the fitting of clutter model,especially when the clutter models are complicated and unknown.