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.
A Graph Neural Network Approach for Solving the Ranked Assignment Problem in Multi-Object Tracking
2024 IEEE Intelligent Vehicles Symposium (IV) ; 2646-2652
2024-06-02
884556 byte
Conference paper
Electronic Resource
English
Optimizing Murty's Ranked Assignment Method
Online Contents | 1997
|Optimizing Murty's ranked assignment method
IEEE | 1997
|Fuzzy spatial constraints and ranked partitioned sampling approach for multiple object tracking
British Library Online Contents | 2012
|