arxivcs.CVcs.DS2026-07-23
Incremental Optimal Assignment for Real-Time Crowd Tracking
Multi-object tracking in dense crowds requires solving a bipartite assignment problem between detections and trajectories at every video frame. The classical Hungarian algorithm solves this in $O(N^3)$ time, which becomes a bottleneck for large scenes with hundreds of people. We…