Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Chan et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: