Conditions on optimal support recovery in unmixing problems by means of multi-penalty regularization
Preprint
Abstract
Inspired by several real-life applications in audio processing and medical image analysis, where the quantity of interest is generated by several sources to be accurately modeled and separated, as well as by recent advances in regularization theory and optimization, we study the conditions on optimal support recovery in inverse problems of unmixing type by means of multi-penalty regularization. We consider and analyze a regularization functional composed of a data-fidelity term, where signal and noise are additively mixed, a non-smooth, convex, sparsity promoting term, and a quadratic penalty term to model the noise. We prove not only that the well-established theory for sparse recovery in the single parameter case can be translated to the multi-penalty settings, but we also demonstrate the enhanced properties of multi-penalty regularization in terms of support identification compared to sole $\ell^1$-minimization. We additionally confirm and support the theoretical results by extensive numerical simulations, which give a statistics of robustness of the multi-penalty regularization scheme with respect to the single-parameter counterpart. Eventually, we confirm a significant improvement in performance compared to standard $\ell^1$-regularization for compressive sensing problems considered in our experiments.Keywords
All Related Versions
- Version 1, 2016-01-07, ArXiv
- Published version: Inverse Problems, 32 (10), 104007.
This publication has 12 references indexed in Scilit:
- Damping Noise-Folding and Enhanced Support Recovery in Compressed SensingIEEE Transactions on Signal Processing, 2015
- Minimization of multi-penalty functionals by alternating iterative thresholding and optimal parameter choicesInverse Problems, 2014
- Multi-penalty regularization with a component-wise penalizationInverse Problems, 2013
- A Mathematical Introduction to Compressive Sensing2013
- The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding versus Dynamic RangeIEEE Transactions on Signal Processing, 2012
- Noise Folding in Compressed SensingIEEE Signal Processing Letters, 2011
- Necessary and sufficient conditions for linear convergence of ℓ1-regularizationCommunications on Pure and Applied Mathematics, 2010
- Multi-parameter regularization and its numerical realizationNumerische Mathematik, 2010
- The Dantzig selector: Statistical estimation when p is much larger than nThe Annals of Statistics, 2007
- Domain decomposition methods for linear inverse problems with sparsity constraintsInverse Problems, 2007