Restricted q-Isometry Properties Adapted to Frames for Nonconvex lq-Analysis

This paper discusses reconstruction of signals from few measurements in the situation that signals are sparse or approximately sparse in terms of a general frame via the $l_q$-analysis optimization with $0<q\leq 1$. We first introduce a notion of restricted $q$-isometry property ($q$-RIP) adapted to a dictionary, which is a natural extension of the standard $q$-RIP, and establish a generalized $q$-RIP condition for approximate reconstruction of signals via the $l_q$-analysis optimization. We then determine how many random, Gaussian measurements are needed for the condition to hold with high probability. The resulting sufficient condition is met by fewer measurements for smaller $q$ than when $q=1$. The introduced generalized $q$-RIP is also useful in compressed data separation. In compressed data separation, one considers the problem of reconstruction of signals' distinct subcomponents, which are (approximately) sparse in morphologically different dictionaries, from few measurements. With the notion of generalized $q$-RIP, we show that under an usual assumption that the dictionaries satisfy a mutual coherence condition, the $l_q$ split analysis with $0<q\leq1 $ can approximately reconstruct the distinct components from fewer random Gaussian measurements with small $q$ than when $q=1$

[1]  Holger Rauhut,et al.  Analysis $\ell_1$-recovery with frames and Gaussian measurements , 2013, 1306.1356.

[2]  Ming Yan,et al.  One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations , 2013, Adv. Comput. Math..

[3]  Gitta Kutyniok,et al.  Microlocal Analysis of the Geometric Separation Problem , 2010, ArXiv.

[4]  S. Osher,et al.  Image restoration: Total variation, wavelet frames, and beyond , 2012 .

[5]  Rick Chartrand,et al.  Exact Reconstruction of Sparse Signals via Nonconvex Minimization , 2007, IEEE Signal Processing Letters.

[6]  S. Foucart,et al.  Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0 , 2009 .

[7]  S. Foucart.  Stability and robustness of ℓ1-minimizations with Weibull matrices and redundant dictionaries , 2014 .

[8]  D. Donoho,et al.  Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA) , 2005 .

[9]  Rachel Ward,et al.  New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property , 2010, SIAM J. Math. Anal..

[10]  Yonina C. Eldar,et al.  Smoothing and Decomposition for Analysis Sparse Recovery , 2013, IEEE Transactions on Signal Processing.

[11]  T. Strohmer,et al.  Gabor Analysis and Algorithms , 2012 .

[12]  Mike E. Davies,et al.  Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces , 2009, IEEE Transactions on Information Theory.

[13]  Michael Elad,et al.  The Cosparse Analysis Model and Algorithms , 2011, ArXiv.

[14]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[15]  S. Mendelson,et al.  Uniform Uncertainty Principle for Bernoulli and Subgaussian Ensembles , 2006, math/0608665.

[16]  Jian-Feng Cai,et al.  Simultaneous cartoon and texture inpainting , 2010 .

[17]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

[18]  T. Strohmer,et al.  Gabor Analysis and Algorithms: Theory and Applications , 1997 .

[19]  Song Li,et al.  Compressed Data Separation With Redundant Dictionaries , 2013, IEEE Transactions on Information Theory.

[20]  E. Candès,et al.  New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities , 2004 .

[21]  R. Chartrand,et al.  Restricted isometry properties and nonconvex compressive sensing , 2007 .

[22]  Song Li,et al.  Compressed Sensing with coherent tight frames via $l_q$-minimization for $0 , 2011, ArXiv.

[23]  I. Daubechies,et al.  Iteratively reweighted least squares minimization for sparse recovery , 2008, 0807.0575.

[24]  Holger Rauhut,et al.  Analysis ℓ1-recovery with Frames and Gaussian Measurements , 2015, ArXiv.

[25]  Michael Elad,et al.  Analysis versus synthesis in signal priors , 2006, 2006 14th European Signal Processing Conference.

[26]  Yulong Liu,et al.  Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis , 2012, IEEE Transactions on Information Theory.

[27]  Song Li,et al.  Restricted p–isometry property and its application for nonconvex compressive sensing , 2012, Adv. Comput. Math..

[28]  Qiyu Sun.  Sparse Approximation Property and Stable Recovery of Sparse Signals From Noisy Measurements , 2011, IEEE Transactions on Signal Processing.

[29]  Rayan Saab,et al.  Stable sparse approximations via nonconvex optimization , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[30]  M. Rudelson,et al.  On sparse reconstruction from Fourier and Gaussian measurements , 2008 .

[31]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[32]  Stéphane Mallat,et al.  A Wavelet Tour of Signal Processing - The Sparse Way, 3rd Edition , 2008 .

[33]  R. Gribonval,et al.  Highly sparse representations from dictionaries are unique and independent of the sparseness measure , 2007 .

[34]  I. Daubechies,et al.  The Canonical Dual Frame of a Wavelet Frame , 2002 .

[35]  Minh N. Do,et al.  A Theory for Sampling Signals from a Union of Subspaces , 2022 .

[36]  D. Donoho.  For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[37]  Yonina C. Eldar,et al.  Compressed Sensing with Coherent and Redundant Dictionaries , 2010, ArXiv.

[38]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

[39]  Akram Aldroubi,et al.  Perturbations of measurement matrices and dictionaries in compressed sensing , 2012 .

[40]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[41]  Anru Zhang,et al.  Sharp RIP bound for sparse signal and low-rank matrix recovery , 2013 .