articleSIAM Journal on Applied MathematicsJan 1, 2006Closed access

Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models

University of California, Los Angeles · École Normale Supérieure Paris-Saclay

Indexed incrossref

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.

Citation impact

1,046
total citations
FWCI
27.19
Percentile
100%
References
25
Citations per year

Authors

3

Topics & keywords

Keywords
  • Minification
  • Regular polygon
  • Convex optimization
  • Image denoising
  • Image processing
  • Image (mathematics)
  • Noise reduction
  • Image segmentation
No related works found for this paper.