Key points are not available for this paper at this time.
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.
Chan et al. (Sun,) studied this question.