CVLGJul 5, 2024

SSP-GNN: Learning to Track via Bilevel Optimization

arXiv:2407.04308v3h-index: 17
Originality Incremental advance
AI Analysis

This addresses multi-object tracking for applications like surveillance or autonomous driving, but it appears incremental as it builds on existing graph-based and GNN approaches.

The paper tackled multi-object tracking by proposing a graph-based method using a graph neural network to compute edge costs, learned via bilevel optimization, and it compared favorably to a baseline in simulated scenarios.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes