arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.01696cs.RO
收藏

基于图神经网络的多目标跟踪中排名分配问题求解方法

A Graph Neural Network Approach for Solving the Ranked Assignment Problem in Multi-Object Tracking

Institute of Measurement, Control and Microtechnology, Ulm University(乌尔姆大学测量、控制与微技术研究所)

Robin Dehler, Martin Herrmann, Jan Strohbeck, Michael Buchholz

AI总结:

本文提出RAPNet,利用图神经网络解决多目标跟踪中的排名分配问题,相比Murty算法和Gibbs采样提升准确性。

摘要:

在多目标跟踪(MOT)中,将测量与轨迹关联是保证自动驾驶安全的关键步骤。为管理指数级增长的轨迹假说数量,截断成为必要。在δ-广义标记多伯努利(δ-GLMB)滤波器应用中,此截断通常涉及排名分配问题,通常通过Murty算法或Gibbs采样方法解决,但两者在复杂度或准确性上均有局限。本文旨在改进这些局限,提出一种基于图神经网络(GNN)的排名分配方法。所提出的排名分配预测图神经网络(RAPNet)利用二分图建模问题,利用深度学习的计算能力。最终评估比较RAPNet与Murty算法和Gibbs采样器,显示相比Gibbs采样器的准确性提升。

英文摘要:

Associating measurements with tracks is a crucial step in Multi-Object Tracking (MOT) to guarantee the safety of autonomous vehicles. To manage the exponentially growing number of track hypotheses, truncation becomes necessary. In the $δ$-Generalized Labeled Multi-Bernoulli ($δ$-GLMB) filter application, this truncation typically involves the ranked assignment problem, solved by Murty's algorithm or the Gibbs sampling approach, both with limitations in terms of complexity or accuracy, respectively. With the motivation to improve these limitations, this paper addresses the ranked assignment problem arising from data association tasks with an approach that employs Graph Neural Networks (GNNs). The proposed Ranked Assignment Prediction Graph Neural Network (RAPNet) uses bipartite graphs to model the problem, harnessing the computational capabilities of deep learning. The conclusive evaluation compares the RAPNet with Murty's algorithm and the Gibbs sampler, showing accuracy improvements compared to the Gibbs sampler.

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

↑