Minimization of Monotonically Levelable Higher Order MRF Energies via Graph Cuts
Authors/Editors
Research Areas
No matching items found.
Publication Details
Output type: Journal article
Author list: Karci MH, Demirekler M
Publisher: Institute of Electrical and Electronics Engineers
Publication year: 2010
Journal: IEEE Transactions on Image Processing (1057-7149)
Volume number: 19
Issue number: 11
Start page: 2849
End page: 2860
Number of pages: 12
ISSN: 1057-7149
eISSN: 1941-0042
Languages: English-Great Britain (EN-GB)
Unpaywall Data
Open access status: closed
Abstract
A feature of minimizing images of submodular binary Markov random field (MRF) energies is introduced. Using this novel feature, the collection of minimizing images of levels of higher order, monotonically levelable multilabel MRF energies is shown to constitute a monotone collection. This implies that these minimizing binary images can be combined to give minimizing images of the multilabel MRF energies. Thanks to the graph cuts framework, the mentioned class of binary MRF energies is known to be minimized by maximum flow computations on appropriately constructed graphs. With the aid of these developments an exact and efficient algorithm to minimize monotonically levelable multilabel MRF energies of any order, which is composed of a series of maximum flow computations, is proposed and an application of the proposed algorithm to image denoising is given.
Keywords
Energy minimization, graph cuts, image denoising, levelable MRF energies, Markov random fields (MRFs)
Documents
No matching items found.
