A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the years for efficient inference, especially in pairwise MRFs. In general there is a trade-off between the complexity/efficien...
Main Authors: | Vineet, V, Warrell, J, Torr, PHS |
---|---|
Format: | Conference item |
Language: | English |
Published: |
IEEE
2012
|
Similar Items
-
Dynamic hybrid algorithms for MAP inference in discrete MRFs
by: Alahari, K, et al.
Published: (2009) -
An analysis of convex relaxations for MAP estimation of discrete MRFs
by: Pawan Kumar, M, et al.
Published: (2009) -
Parallel and Deterministic Algorithms for MRFs: Surface Reconstruction and Integration
by: Geiger, Davi, et al.
Published: (2004) -
Cooled and relaxed survey propagation for MRFs
by: Chieu, H, et al.
Published: (2009) -
Integrating vision modules with coupled MRFs
by: Poggio, Tomaso
Published: (2008)