Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models
2006Published
859Citations
0References
journal articleType
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.
Journal: SIAM Journal on Applied Mathematics
Publisher: Society for Industrial & Applied Mathematics (SIAM)
Citations are the number of DOI-registered works in Crossref that cite this paper; references are how many works it cites. Full text is on the publisher site via the DOI link.