arXiv · 2407.04308
SSP-GNN: Learning to Track via Bilevel Optimization
Abstract
We propose a graph-based tracking formulation for multi-object tracking (MOT) where target detections contain kinematic information and re-identification features (attributes). Our method applies a successive shortest paths (SSP) algorithm to a tracking graph defined over a batch of frames. The edge costs in this tracking graph are computed via a message-passing network, a graph neural network (GNN) variant. The parameters of the GNN, and hence, the tracker, are learned end-to-end on a training set of example ground-truth tracks and detections. Specifically, learning takes the form of bilevel optimization guided by our novel loss function. We evaluate our algorithm on simulated scenarios to understand its sensitivity to scenario aspects and model hyperparameters. Across varied scenario complexities, our method compares favorably to a strong baseline.
Explore related subjects
Keep this discovery
Griffin Golias, Masa Nakura-Fan, Vitaly Ablavsky. 2024-07-05. SSP-GNN: Learning to Track via Bilevel Optimization. https://arxiv.org/abs/2407.04308
Cite the original work for its findings. Save a collection to share your selection of sources.