Algorithms for finding global minimizers of image segmentation and denoising models

T.F. Chan, S. Esedoglu, M. Nikolova

Research output: Contribution to journalArticlepeer-review

761 Scopus citations

Abstract

We show how certain nonconvex optimization problems that arise in image processing and computer vision can be restated as convex minimization problems. This allows, in particular, the finding of global minimizers via standard convex minimization schemes. © 2006 Society for Industrial and Applied Mathematics.
Original languageEnglish
Pages (from-to)1632-1648
Number of pages17
JournalSIAM Journal on Applied Mathematics
Volume66
Issue number5
DOIs
StatePublished - 2006
Externally publishedYes

Keywords

  • Convex minimization problems
  • Denoising
  • Denoising models
  • Nonconvex optimization, Algorithms
  • Computer vision
  • Global optimization
  • Problem solving, Image segmentation

Fingerprint Dive into the research topics of 'Algorithms for finding global minimizers of image segmentation and denoising models'. Together they form a unique fingerprint.

Cite this