Biomedical Imaging GroupSTI
English only   BIG > Publications > Potts Regularization

 Home Page
 News & Events
 Tutorials and Reviews
 Download Algorithms

 All BibTeX References

Mumford-Shah and Potts Regularization for Manifold-Valued Data

A. Weinmann, L. Demaret, M. Storath

Journal of Mathematical Imaging and Vision, vol. 55, no. 3, pp. 428-445, July 2016.

Mumford-Shah and Potts functionals are powerful variational models for regularization which are widely used in signal and image processing; typical applications are edge-preserving denoising and segmentation. Being both non-smooth and non-convex, they are computationally challenging even for scalar data. For manifold-valued data, the problem becomes even more involved since typical features of vector spaces are not available. In this paper, we propose algorithms for Mumford-Shah and for Potts regularization of manifold-valued signals and images. For the univariate problems, we derive solvers based on dynamic programming combined with (convex) optimization techniques for manifold-valued data. For the class of Cartan-Hadamard manifolds (which includes the data space in diffusion tensor imaging (DTI)), we show that our algorithms compute global minimizers for any starting point. For the multivariate Mumford-Shah and Potts problems (for image regularization), we propose a splitting into suitable subproblems which we can solve exactly using the techniques developed for the corresponding univariate problems. Our method does not require any priori restrictions on the edge set and we do not have to discretize the data space. We apply our method to DTI as well as Q-ball imaging. Using the DTI model, we obtain a segmentation of the corpus callosum on real data.

AUTHOR="Weinmann, A. and Demaret, L. and Storath, M.",
TITLE="{M}umford-{S}hah and {P}otts Regularization for Manifold-Valued
JOURNAL="Journal of Mathematical Imaging and Vision",

© 2016 Springer. 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 Springer.
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.