On partial optimality in multi-label MRFs
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as an integer linear programming and relax the integrality constraints. The approach we consider in this paper is to first...
Hauptverfasser: | Kohli, P, Shekhovtsov, A, Rother, C, Kolmogorov, V, Torr, P |
---|---|
Format: | Conference item |
Sprache: | English |
Veröffentlicht: |
Association for Computing Machinery
2008
|
Ähnliche Einträge
Ähnliche Einträge
-
Reduce, reuse and recycle: efficiently solving multi-label MRFs
von: Alahari, K, et al.
Veröffentlicht: (2008) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
von: Pawan Kumar, M, et al.
Veröffentlicht: (2009) -
Dynamic hybrid algorithms for MAP inference in discrete MRFs
von: Alahari, K, et al.
Veröffentlicht: (2009) -
A tiered move-making algorithm for general pairwise MRFs
von: Vineet, V, et al.
Veröffentlicht: (2012) -
Integrating vision modules with coupled MRFs
von: Poggio, Tomaso
Veröffentlicht: (2008)