activity
20102025
most citedOn the optimality of tree-reweighted max-product message-passing

101 citations · 355 across the 29 of their papers we have counts for

collaborators
Showing cs.CVShow all

5 papers · 1 filter

cs.CV2016

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).…

cs.CV2015★ 1 cited

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…

cs.CV2014★ 1 cited

Proceedings of The 38th Annual Workshop of the Austrian Association for Pattern Recognition (ÖAGM), 2014

Vladimir Kolmogorov, Christoph Lampert, Emilie Morvant +1

The 38th Annual Workshop of the Austrian Association for Pattern Recognition (ÖAGM) will be held at IST Austria, on May 22-23, 2014. The workshop provides a platform for researcher…

cs.CV2013★ 1 cited

Potts model, parametric maxflow and k-submodular functions

Igor Gridchyn, Vladimir Kolmogorov

The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19,20]. It ide…

cs.CV2012★ 3 cited

Generalized sequential tree-reweighted message passing

Vladimir Kolmogorov, Thomas Schoenemann

This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem…