DMCA
Energy Minimization for Linear Envelope MRFs
| Citations: | 26 - 8 self |
BibTeX
@MISC{Kohli_energyminimization,
author = {Pushmeet Kohli and M. Pawan Kumar},
title = {Energy Minimization for Linear Envelope MRFs},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new representation for higher order potentials as upper and lower envelopes of linear functions. Our representation concisely models several commonly used higher order potentials, thereby providing a unified framework for minimizing the corresponding Gibbs energy functions. We exploit this framework by converting lower envelope potentials to standard pairwise functions with the addition of a small number of auxiliary variables. This allows us to minimize energy functions with lower envelope potentials using conventional algorithms such as BP, TRW and α-expansion. Furthermore, we show how the minimization of energy functions with upper envelope potentials leads to a difficult minmax problem. We address this difficulty by proposing a new message passing algorithm that solves a linear programming relaxation of the problem. Although this is primarily a theoretical paper, we demonstrate the efficacy of our approach on the binary (fg/bg) segmentation problem. 1.
Keyphrases
linear envelope mrfs energy minimization order potential energy function envelope potential markov random field corresponding gibbs energy function linear programming relaxation segmentation problem several problem difficult minmax problem computer vision linear function conventional algorithm new representation theoretical paper upper envelope potential pairwise function new message small number fg bg powerful model auxiliary variable unified framework
