arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.03729stat.MEeess.SP
收藏

标号随机有限集滤波器中具有相关似然结构的多目标跟踪

Multi-Target Tracking with Dependent Likelihood Structures in Labeled Random Finite Set Filters

Lingji Chen

摘要:

在多目标跟踪中,数据关联假设将测量分配给航迹,并且(联合目标测量关联的)假设似然用于在有限计算预算下在所有假设之间进行比较以进行截断。然而,通常假设个体目标-测量关联可能性独立于其他,即,无论它属于哪种假设,它都是一样的。在面向轨道的多假设跟踪(TO-MHT)的情况下,这导致假设空间的简约表示,其中通过求解线性规划问题获得极大似然解。在标签随机有限集(标签RFS)过滤器,这导致了一种有效的方式来获得排名靠前的假设,通过解决排名分配问题,使用Murty的算法。在本文中,我们提出了一个建议和验证的方法,某些依赖的似然结构,这样的真实假设的可能性进行评估,共同为组成的轨道测量协会,以说明它们之间的依赖性,但在同一时间,排名仍然是有效地获得。这是通过在独立性假设下提出候选排名,然后逐个评估真实似然来实现的,对于某些依赖似然结构,保证不从其候选值增加,直到获得期望数量的排名靠前的假设。这种依赖似然结构的例子包括碰撞似然结构和遮挡似然结构,这两种结构在应用中经常遇到。

英文摘要:

In multi-target tracking, a data association hypothesis assigns measurements to tracks, and the hypothesis likelihood (of the joint target-measurement associations) is used to compare among all hypotheses for truncation under a finite compute budget. It is often assumed however that an individual target-measurement association likelihood is independent of others, i.e., it remains the same in whichever hypothesis it belongs to. In the case of Track Oriented Multiple Hypothesis Tracking (TO-MHT), this leads to a parsimonious representation of the hypothesis space, with a maximum likelihood solution obtained through solving an Integer Linear Programming problem. In Labeled Random Finite Set (Labeled RFS) filters, this leads to an efficient way of obtaining the top ranked hypotheses through solving a ranked assignment problem using Murty's algorithm. In this paper we present a Propose and Verify approach for certain Dependent Likelihood Structures, such that the true hypothesis likelihood is evaluated jointly for the constituent track-measurement associations to account for dependence among them, but at the same time that ranking is still obtained efficiently. This is achieved by proposing a candidate ranking under an assumption of independence, and then evaluating the true likelihood one by one, which is guaranteed, for certain Dependent Likelihood Structures, to not increase from its candidate value, until the desired number of top ranked hypotheses are obtained. Examples of such Dependent Likelihood Structures include the Collision Likelihood Structure and the Occlusion Likelihood Structure, both encountered frequently in applications.

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

↑