Indexed metadata

Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models

Tony F. Chan, Selim Esedoglu, Mila Nikolova

Source record

Source: Crossref

Published: Jan 1, 2006

DOI: 10.1137/040615286

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models — Mathematical Frontier Network