.png){kind=icon}
.png){kind=icon}
Return
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
Abstract
En 中文
To overcome computerized intractability and imprecise estimation of the standard cardinalized probability hypothesis density (CPHD) filter for multitarget tracking (MU), an improved CPHD filtering algorithm is proposed in this paper. We apply Sequential Monte Carlo (SMC) method to achieve the closed-form solution in the filtering process as well as to avoid missed detection. Afterwards we partition the particle set into surviving particles and newborn particles based on the particle labels. To eliminate the overestimated target number, the weights of newborn particles are assigned to increase to surviving particles on average. Simulations are presented to compare the performance of the proposed filtering algorithm with that of the standard one. The results show that the proposed filtering algorithm can effectively achieve MTT with better performance. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Multitarget tracking
Cardinalized probability hypothesis density
Probability density
Particle
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W