DocumentCode
3490029
Title
A graph-cut based algorithm for approximate MRF optimization
Author
Shabou, Aymen ; Tupin, Florence ; Darbon, Jérôme
Author_Institution
Inst. TELECOM, TELECOM ParisTech, Paris, France
fYear
2009
fDate
7-10 Nov. 2009
Firstpage
2413
Lastpage
2416
Abstract
This paper copes with the approximate minimization of Markovian energy with pairwise interactions. We extend previous approaches that rely on graph-cuts and move making techniques. For this purpose, a new move is introduced that permits us to perform better approximate optimizations. Some experiments show that very good local minima are obtained while keeping the memory usage low.
Keywords
Markov processes; graph theory; optimisation; Markovian energy; approximate MRF optimization; approximate minimization; graph cut; move making techniques; pairwise interaction; Image denoising; Image restoration; Image segmentation; Iterative algorithms; Lattices; Markov random fields; Minimization methods; Optimization methods; Partitioning algorithms; Telecommunications; Graph-cut; Image restoration; Optimization methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Image Processing (ICIP), 2009 16th IEEE International Conference on
Conference_Location
Cairo
ISSN
1522-4880
Print_ISBN
978-1-4244-5653-6
Electronic_ISBN
1522-4880
Type
conf
DOI
10.1109/ICIP.2009.5414189
Filename
5414189
Link To Document