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...
Príomhchruthaitheoirí: | Kohli, P, Shekhovtsov, A, Rother, C, Kolmogorov, V, Torr, P |
---|---|
Formáid: | Conference item |
Teanga: | English |
Foilsithe / Cruthaithe: |
Association for Computing Machinery
2008
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Reduce, reuse and recycle: efficiently solving multi-label MRFs
de réir: Alahari, K, et al.
Foilsithe / Cruthaithe: (2008) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
de réir: Pawan Kumar, M, et al.
Foilsithe / Cruthaithe: (2009) -
Dynamic hybrid algorithms for MAP inference in discrete MRFs
de réir: Alahari, K, et al.
Foilsithe / Cruthaithe: (2009) -
A tiered move-making algorithm for general pairwise MRFs
de réir: Vineet, V, et al.
Foilsithe / Cruthaithe: (2012) -
Integrating vision modules with coupled MRFs
de réir: Poggio, Tomaso
Foilsithe / Cruthaithe: (2008)