AI Paper Atlas

Research map / Detection and segmentation / Tracking

muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking

Congchao Wang, Yizhi Wang, Yinxue Wang, Chiung-Ting Wu, Guoqiang Yu

NeurIPS 2019 · Detection and segmentation › Tracking · approach: Association cues for online MOT · 15 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace SSP with muSSP (minimum-update shortest path tree, edge clipping, multi-path flipping, batch Dijkstra)min-cost flow data association · MOT datasets, 39 experimentsrunning time: 4193 times faster than SSP on averageImproved
use muSSP instead of cs2 as min-cost flow subroutine in Frank-Wolfe QPPETS S1.L1-2 quadratic programming · PETS S1.L1-2running time (s): 613.1 -> 20.3Improved
use FollowMe instead of SSP on graphs with many objectsbaseline solver · CVPR19 seq04running time: 1.8h -> 2.4hHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy