Skip to main navigation Skip to search Skip to main content

A graph-cut based algorithm for approximate MRF optimization

  • CNRS LTCI
  • University of California, Los Angeles

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2009 IEEE International Conference on Image Processing, ICIP 2009 - Proceedings
PublisherIEEE Computer Society
Pages2413-2416
Number of pages4
ISBN (Print)9781424456543
DOIs
Publication statusPublished - 1 Jan 2009
Externally publishedYes
Event2009 IEEE International Conference on Image Processing, ICIP 2009 - Cairo, Egypt
Duration: 7 Nov 200910 Nov 2009

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference2009 IEEE International Conference on Image Processing, ICIP 2009
Country/TerritoryEgypt
CityCairo
Period7/11/0910/11/09

Keywords

  • Graph-cut
  • Image restoration
  • Optimization methods

Fingerprint

Dive into the research topics of 'A graph-cut based algorithm for approximate MRF optimization'. Together they form a unique fingerprint.

Cite this