An Algorithmic Framework for Mumford-Shah Regularization of Inverse Problems in Imaging

K. Hohm, M. Storath, A. Weinmann

Inverse Problems, vol. 31, no. 11, paper no. 115011, November 2015.

The Mumford-Shah model is a very powerful variational approach for edge preserving regularization of image reconstruction processes. However, it is algorithmically challenging because one has to deal with a non-smooth and non-convex functional. In this paper, we propose a new efficient algorithmic framework for Mumford-Shah regularization of inverse problems in imaging. It is based on a splitting into specific subproblems that can be solved exactly. We derive fast solvers for the subproblems which are key for an efficient overall algorithm. Our method neither requires a priori knowledge of the gray or color levels nor of the shape of the discontinuity set. We demonstrate the wide applicability of the method for different modalities. In particular, we consider the reconstruction from Radon data, inpainting, and deconvolution. Our method can be easily adapted to many further imaging setups. The relevant condition is that the proximal mapping of the data fidelity can be evaluated a within reasonable time. In other words, it can be used whenever classical Tikhonov regularization is possible.

Selected by the Editorial Board as a highlight paper from Inverse Problems in 2015.

@ARTICLE(http://bigwww.epfl.ch/publications/hohm1501.html,
AUTHOR="Hohm, K. and Storath, M. and Weinmann, A.",
TITLE="An Algorithmic Framework for {M}umford-{S}hah Regularization of
        Inverse Problems in Imaging",
JOURNAL="Inverse Problems",
YEAR="2015",
volume="31",
number="11",
pages="",
month="November",
note="paper no.\ 115011")

© 2015 IOP. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IOP.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.