On the Complexity of Mumford–Shah-Type Regularization, Viewed as a Relaxed Sparsity Constraint

We show that inverse problems with a truncated quadratic regularization are NP-hard in general to solve or even approximate up to an additive error. This stands in contrast to the case corresponding to a finite-dimensional approximation to the Mumford-Shah functional, where the operator involved is the identity and for which polynomial-time solutions are known. Consequently, we confirm the infeasibility of any natural extension of the Mumford-Shah functional to general inverse problems. A connection between truncated quadratic minimization and sparsity-constrained minimization is also discussed.

[1]  Jos B. T. M. Roerdink,et al.  The Watershed Transform: Definitions, Algorithms and Parallelization Strategies , 2000, Fundam. Informaticae.

[2]  Antonin Chambolle,et al.  Image Segmentation by Variational Methods: Mumford and Shah Functional and the Discrete Approximations , 1995, SIAM J. Appl. Math..

[3]  Sukhendu Das,et al.  Integrating region and edge information for texture segmentation using a modified constraint satisfaction neural network , 2008, Image Vis. Comput..

[4]  Julian Besag,et al.  Digital Image Processing: Towards Bayesian image analysis , 1989 .

[5]  Mila Nikolova,et al.  Thresholding implied by truncated quadratic regularization , 2000, IEEE Trans. Signal Process..

[6]  Luca Rondi,et al.  Reconstruction in the inverse crack problem by variational methods , 2008, European Journal of Applied Mathematics.

[7]  B. S. Manjunath,et al.  Color image segmentation , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[8]  John W. Woods,et al.  Simulated annealing in compound Gaussian random fields , 1990, IEEE Trans. Inf. Theory.

[9]  Narendra Ahuja,et al.  Multiscale image segmentation by integrated edge and region detection , 1997, IEEE Trans. Image Process..

[10]  Pierre Machart.  Morphological Segmentation , 2009 .

[11]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[12]  John F. Haddon,et al.  Image Segmentation by Unifying Region and Boundary Information , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[14]  J. L. Moigne,et al.  Refining image segmentation by integration of edge and region data , 1992, IEEE Trans. Geosci. Remote. Sens..

[15]  L. Rondi.  A variational approach to the reconstruction of cracks by boundary measurements , 2007 .

[16]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[17]  Massimo Fornasier,et al.  Iterative Thresholding Meets Free-Discontinuity Problems , 2009, Found. Comput. Math..

[18]  Alan L. Yuille,et al.  A common framework for image segmentation , 1990, International Journal of Computer Vision.

[19]  Jake K. Aggarwal,et al.  The Integration of Image Segmentation Maps using Region and Edge Information , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Theodosios Pavlidis,et al.  Integrating region growing and edge detection , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[21]  Jianping Fan,et al.  Automatic image segmentation by integrating color-edge extraction and seeded region growing , 2001, IEEE Trans. Image Process..

[22]  Chih-Cheng Hung,et al.  Boundary Refined Texture Segmentation Based on K-Views and Datagram Methods , 2007, 2007 IEEE Symposium on Computational Intelligence in Image and Signal Processing.