Title :
A Convex Relaxation of the Ambrosio-Tortorelli Elliptic Functionals for the Mumford-Shah Functional
Author :
Youngwook Kee ; Junmo Kim
Author_Institution :
KAIST, Daejeon, South Korea
Abstract :
In this paper, we revisit the phase-field approximation of Ambrosio and Tortorelli for the Mumford -- Shah functional. We then propose a convex relaxation for it to attempt to compute globally optimal solutions rather than solving the nonconvex functional directly, which is the main contribution of this paper. Inspired by McCormick´s seminal work on factorable nonconvex problems, we split a nonconvex product term that appears in the Ambrosio -- Tortorelli elliptic functionals in a way that a typical alternating gradient method guarantees a globally optimal solution without completely removing coupling effects. Furthermore, not only do we provide a fruitful analysis of the proposed relaxation but also demonstrate the capacity of our relaxation in numerous experiments that show convincing results compared to a naive extension of the McCormick relaxation and its quadratic variant. Indeed, we believe the proposed relaxation and the idea behind would open up a possibility for convexifying a new class of functions in the context of energy minimization for computer vision.
Keywords :
computer vision; convex programming; functional analysis; gradient methods; Ambrosio-Tortorelli elliptic functionals; McCormick relaxation; Mumford-Shah functional; alternating gradient method; computer vision; convex relaxation; energy minimization; factorable nonconvex problems; nonconvex functional directly; nonconvex product term; phase-field approximation; quadratic variant; Approximation methods; Context; Equations; Jacobian matrices; Level set; Mathematical model; Minimization; AmbrosioTortorelli approximation; MumfordShah functional; convex relaxation;
Conference_Titel :
Computer Vision and Pattern Recognition (CVPR), 2014 IEEE Conference on
Conference_Location :
Columbus, OH
DOI :
10.1109/CVPR.2014.519