DMCA
Exact Inference in Multi-label CRFs with Higher Order Cliques (2008)
Cached
Download Links
| Citations: | 50 - 11 self |
BibTeX
@MISC{Ramalingam08exactinference,
author = {Srikumar Ramalingam and Pushmeet Kohli and Karteek Alahari and Philip H. S. Torr},
title = {Exact Inference in Multi-label CRFs with Higher Order Cliques},
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to transform special classes of multi-label higher order functions to submodular second order boolean functions (referred to as F 2 s), which can be minimized exactly using graph cuts and we characterize those classes. The basic idea is to use two or more boolean variables to encode the states of a single multi-label variable. There are many ways in which this can be done and much interesting research lies in finding ways which are optimal or minimal in some sense. We study the space of possible encodings and find the ones that can transform the most general class of functions to F 2 s. Our main contributions are two-fold. First, we extend the subclass of submodular energy functions that can be minimized exactly using graph cuts. Second, we show how higher order potentials can be used to improve single view 3D reconstruction results. We believe that our work on exact minimization of higher order energy functions will lead to similar improvements in solutions of other labelling problems. 1.
Keyphrases
order clique multi-label crfs exact inference graph cut much interesting research possible encoding special class reconstruction result boolean variable second order boolean function discrete multi-label mrfs single multi-label variable posteriori solution general class basic idea main contribution many way order potential similar improvement single view order energy function submodular energy function order function exact minimization
