84 citations · 88 across the 3 of their papers we have counts for
Showing cs.CVShow all
2 papers · 1 filter
cs.CV2021
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths
Andrea Hornakova, Timo Kaiser, Paul Swoboda +3
We present an efficient approximate message passing solver for the lifted disjoint paths problem (LDP), a natural but NP-hard model for multiple object tracking (MOT). Our tracker…
cs.CV2020★ 84 cited
Lifted Disjoint Paths with Application in Multiple Object Tracking
Andrea Hornakova, Roberto Henschel, Bodo Rosenhahn +1
We present an extension to the disjoint paths problem in which additional \emph{lifted} edges are introduced to provide path connectivity priors. We call the resulting optimization…