マルチオブジェクト追跡におけるランク付き割当問題を解くグラフニューラルネットワーク手法
A Graph Neural Network Approach for Solving the Ranked Assignment Problem in Multi-Object Tracking
マルチオブジェクト追跡のデータ関連付けで生じるランク付き割当問題を、二部グラフを用いたグラフニューラルネットワーク(RAPNet)で解く手法を提案し、Gibbsサンプラーより高精度であることを示した。
詳しい要約
1. どんなもの?
2. 先行研究と比べてどこがすごい?
3. 技術・手法の肝は?
4. どうやって有効だと検証した?
5. 議論はある?
6. 次に読むべき論文は?
※ AIが要旨から生成した要約です。正確性は原文をご確認ください。
著者: Robin Dehler, Martin Herrmann, Jan Strohbeck, Michael Buchholz
分類: cs.RO
原文アブストラクト
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 $\delta$-Generalized Labeled Multi-Bernoulli ($\delta$-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.
