Search Results for author:
Found 3 papers, 2 papers with code
Structured Prediction Problem Archive
In order to facilitate algorithm development for their numerical solution, we collect in one place a large number of datasets in easy to read formats for a diverse set of problem classes.
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths
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).
Lifted Disjoint Paths with Application in Multiple Object Tracking
We present an extension to the disjoint paths problem in which additional \emph{lifted} edges are introduced to provide path connectivity priors.
Ranked #2 on
Multi-Object Tracking
on 2D MOT 2015
