arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.02570stat.AP
收藏

基数化概率假设密度滤波器的无迹辅助粒子滤波器实现

Unscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filter

Meysam R. Danaee

摘要:

概率假设密度(PHD)滤波器通过在时间上逼近随机有限目标集(RFS)的强度函数,减少了最优贝叶斯多目标滤波的计算量。然而,作为一个强大的去杂算法,它的缺点是缺乏精确的估计的期望目标数。作为PHD递归的推广,基数化PHD(CPHD)递归将强度函数和后验基数分布联合传播,弥补了这一缺陷。虽然有一些新的方法来增强PHD滤波器的序贯蒙特卡罗(SMC)实现,但CPHD滤波器的当前SMC实现在估计精度方面性能较差。在本文中,基于无迹变换(UT),我们提出了一种辅助实现的CPHD滤波器的高度非线性系统。为此,我们用线性泛函的预测和更新估计来近似初等对称函数。随后,我们通过数值模拟证明,我们的算法显着执行SMC-CPHD滤波器和辅助粒子实现的PHD滤波器在困难的情况下,高杂波。我们还比较了我们提出的算法与其同行的其他指标,如运行时间和新的目标外观的敏感性。

英文摘要:

The probability hypothesis density (PHD) filter alleviates the computational expense of the optimal Bayesian multi-target filtering by approximating the intensity function of the random finite set (RFS) of targets in time. However, as a powerful decluttering algorithm, it suffers from lack of the precise estimation of the expected number of targets. The cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, is to remedy this flaw, which jointly propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (SMC) implementation of the PHD filter, current SMC implementation for the CPHD filter suffers from poor performance in terms of accuracy of estimate. In this paper, based on the unscented transform (UT), we propose an auxiliary implementation of the CPHD filter for highly nonlinear systems. To that end, we approximate the elementary symmetric functions both with the predicted and with the update estimate of the linear functional. We subsequently demonstrate via numerical simulations that our algorithms significantly out performs both the SMC-CPHD filter and the auxiliary particle implementation of the PHD filter in difficult situations with high clutter. We also compare our proposed algorithm with its counterparts in terms of other metrics, such as run times and sensitivity to new target appearance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑