DMCA
Optimizing binary MRFS with higher order cliques (2008)
| Citations: | 11 - 0 self |
BibTeX
@MISC{Ali08optimizingbinary,
author = {Asem M. Ali and Aly A. Farag and Georgy L. Gimel’farb},
title = {Optimizing binary MRFS with higher order cliques},
year = {2008}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Widespread use of efficient and successful solutions of Com-puter Vision problems based on pairwise Markov Random Field (MRF) models raises a question: does any link exist between the pairwise and higher order MRFs such that the like solutions can be applied to the latter models? This work explores such a link for binary MRFs that allow us to represent Gibbs energy of signal interaction with a polyno-mial function. We show how a higher order polynomial can be efficiently transformed into a quadratic function. Then energy minimization tools for the pairwise MRF models can be easily applied to the higher or-der counterparts. Also, we propose a method to analytically estimate the potential parameter of the asymmetric Potts prior. The proposed framework demonstrates very promising experimental results of image segmentation and can be used to solve other Computer Vision problems. 1
Keyphrases
binary mrfs order clique order mrfs com-puter vision problem polyno-mial function pairwise markov random field like solution latter model asymmetric potts image segmentation potential parameter successful solution or-der counterpart signal interaction quadratic function energy minimization tool computer vision problem promising experimental result widespread use gibbs energy order polynomial pairwise mrf model
