Sciweavers

Share
CVPR
2009
IEEE

Global Connectivity Potentials for Random Field Models

10 years 8 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions and cannot model global properties, such as connectedness, which is a potentially useful high-level prior for object segmentation. In this work, we overcome this limitation by deriving a potential function that enforces the output labeling to be connected and that can naturally be used in the framework of recent MAP-MRF LP relaxations. Using techniques from polyhedral combinatorics, we show that a provably tight approximation to the MAP solution of the resulting MRF can still be found efficiently by solving a sequence of max-flow problems. The efficiency of the inference procedure also allows us to learn the parameters of a MRF with global connectivity potentials by means of a cutting plane algorithm. We experimentally evaluate our algorithm on both synthetic data and on the challenging segmentati...
Sebastian Nowozin, Christoph H. Lampert
Added 09 May 2009
Updated 10 Dec 2009
Type Conference
Year 2009
Where CVPR
Authors Sebastian Nowozin, Christoph H. Lampert
Comments (0)
books