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...
Autori principali: | Kohli, P, Shekhovtsov, A, Rother, C, Kolmogorov, V, Torr, P |
---|---|
Natura: | Conference item |
Lingua: | English |
Pubblicazione: |
Association for Computing Machinery
2008
|
Documenti analoghi
Documenti analoghi
-
Reduce, reuse and recycle: efficiently solving multi-label MRFs
di: Alahari, K, et al.
Pubblicazione: (2008) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
di: Pawan Kumar, M, et al.
Pubblicazione: (2009) -
Dynamic hybrid algorithms for MAP inference in discrete MRFs
di: Alahari, K, et al.
Pubblicazione: (2009) -
A tiered move-making algorithm for general pairwise MRFs
di: Vineet, V, et al.
Pubblicazione: (2012) -
Integrating vision modules with coupled MRFs
di: Poggio, Tomaso
Pubblicazione: (2008)