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.
Bibliographical notecited By 644
- Convex minimization problems
- Denoising models
- Nonconvex optimization, Algorithms
- Computer vision
- Global optimization
- Problem solving, Image segmentation