The Mumford-Shah model has been well acknowledged as an important method for image segmentation. This paper discussed the problem of simultaneous image segmentation and smoothing by approaching the Mumford-Shah paradigm from a numerical approximation perspective. In particular, a novel iterative relaxation algorithm for the numerical solving of the Mumford-Shah model was proposed. First, the paper presented mathematically the existence of a solution in the weak formulation of GSBV space. Second, some approximations and numerical methods for computing the weak solution were discussed. Finally, a minimization method based on a quasi-Newton algorithm was put forward. The proposed algorithm found accurately the absolute minimum of the functional at each iteration. Considering the important role of a discrete finite element approximation method in the sense of Γ-convergence, an adjustment scheme for adaptive triangulation was applied to improve the efficiency of iteration. Experimental results on noisy synthetic and jacquard images demonstrate the efficacy of the proposed algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.