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

From MaRDI portal
Publication:5366556

DOI10.1109/TIP.2010.2048969zbMATH Open1371.94020arXiv1001.2952WikidataQ84114377 ScholiaQ84114377MaRDI QIDQ5366556FDOQ5366556

Boris Alexeev, Rachel Ward

Publication date: 9 October 2017

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1001.2952







Cited In (7)





This page was built for publication: On the Complexity of Mumford–Shah-Type Regularization, Viewed as a Relaxed Sparsity Constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366556)