75 citations · 210 across the 10 of their papers we have counts for
3 papers · 1 filter
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…
Efficient Optimization for Rank-based Loss Functions
Pritish Mohapatra, Michal Rolinek, C. V. Jawahar +2
The accuracy of information retrieval systems is often measured using complex loss functions such as the average precision (AP) or the normalized discounted cumulative gain (NDCG).…
Total variation on a tree
Vladimir Kolmogorov, Thomas Pock, Michal Rolinek
We consider the problem of minimizing the continuous valued total variation subject to different unary terms on trees and propose fast direct algorithms based on dynamic programmin…