arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.3298eess.SYcs.SYmath.OC
收藏

随机有限集滤波器的图模型近似

Graphical model approximations of random finite set filters

Defence Science and Technology Organisation(国防科学与技术组织)

Jason L. Williams

AI总结:

本文提出一种结合数据关联的随机有限集滤波算法,通过边际关联权重的近似保持计算可行性,并利用网络流优化解决航迹合并问题,同时推导出多目标密度自然包含泊松点过程和多伯努利分量,并引入回收机制实现M-C与PHD的混合。

摘要:

随机有限集(RFS)近年来已成为一个富有成果的研究领域,产生了新的近似滤波器,如概率假设密度(PHD)、基数化PHD(CPHD)和多目标多伯努利(MeMBer)。这些新方法主要基于避免测量-航迹关联的近似。相比之下,结合数据关联的RFS方法,如Morelande和Challa(M-C)方法,受到的关注较少。本文提供了一种RFS算法,该算法类似于M-C方法结合数据关联,但通过最近开发的边际关联权重近似保持计算可行性。我们描述了一种解决航迹合并现象的有效方法,该现象对联合概率数据关联(JPDA)及相关方法(包括M-C)构成问题。该方法利用网络流优化,因此对于大量目标是可处理的。最后,我们的推导还表明,多目标密度自然包含泊松点过程(PPP)分量(表示从未被检测到的目标)和多伯努利分量(表示正在跟踪的目标)。我们描述了一种回收方法,其中存在概率低的航迹从多伯努利分量转移到PPP分量,有效地产生了M-C和PHD的混合。

英文摘要:

Random finite sets (RFSs) has been a fruitful area of research in recent years, yielding new approximate filters such as the probability hypothesis density (PHD), cardinalised PHD (CPHD), and multiple target multi-Bernoulli (MeMBer). These new methods have largely been based on approximations that side-step the need for measurement-to-track association. Comparably, RFS methods that incorporate data association, such as Morelande and Challa's (M-C) method, have received little attention. This paper provides a RFS algorithm that incorporates data association similarly to the M-C method, but retains computational tractability via a recently developed approximation of marginal association weights. We describe an efficient method for resolving the track coalescence phenomenon which is problematic for joint probabilistic data association (JPDA) and related methods (including M-C). The method utilises a network flow optimisation, and thus is tractable for large numbers of targets. Finally, our derivation also shows that it is natural for the multi-target density to incorporate both a Poisson point process (PPP) component (representing targets that have never been detected) and a multi-Bernoulli component (representing targets under track). We describe a method of recycling, in which tracks with a low probability existence are transferred from the multi-Bernoulli component to the PPP component, effectively yielding a hybrid of M-C and PHD.

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

↑