Generalized Notions of Sparsity and Restricted Isometry Property. Part II: Applications

Restricted isometry property (RIP) provides a near isometric map for sparse signals. RIP of structured random matrices has played a key role for dimensionality reduction and recovery from compressive measurements. In a companion paper, we have developed a unified theory for RIP of group structured measurement operators on generalized sparsity models. The implication of the extended result will be further discussed in this paper in terms of its pros and cons over the conventional theory. We first show that the extended RIP theory enables the optimization of sample complexity over various relaxations of the canonical sparsity model. Meanwhile, the generalized sparsity model is no longer described as a union of subspaces. Thus the sparsity level is not sub-additive. This incurs that RIP of double the sparsity level does not imply RIP on the Minkowski difference of the sparsity model with itself, which is crucial for dimensionality reduction. We show that a group structured measurement operator provides an RIP-like property with additive distortion for non-sub-additive models. This weaker result can be useful for applications like locality-sensitive hashing. Moreover, we also present that the group structured measurements with random sign enables near isometric sketching on any set similar to the Gaussian measurements. Lastly, an extension of theory to infinite dimension is derived and illustrated over selected examples given by Lebesgue measure of support and Sobolev seminorms.

[1]  Michael Unser,et al.  Splines: a perfect fit for signal and image processing , 1999, IEEE Signal Process. Mag..

[2]  Reinhard Heckel,et al.  Super-Resolution Radar , 2014, ArXiv.

[3]  Thierry Blu,et al.  Sampling Curves With Finite Rate of Innovation , 2014, IEEE Transactions on Signal Processing.

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

[5]  Marius Junge,et al.  Generalized notions of sparsity and restricted isometry property. Part I: a unified framework , 2017, Information and Inference: A Journal of the IMA.

[6]  J. Diestel,et al.  Absolutely Summing Operators , 1995 .

[7]  Benjamin Recht,et al.  Isometric sketching of any set via the Restricted Isometry Property , 2015, ArXiv.

[8]  Ben Adcock,et al.  Generalized Sampling and Infinite-Dimensional Compressed Sensing , 2015, Foundations of Computational Mathematics.

[9]  Benjamin Recht,et al.  The alternating descent conditional gradient method for sparse inverse problems , 2015, 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).

[10]  Emmanuel J. Candès,et al.  Towards a Mathematical Theory of Super‐resolution , 2012, ArXiv.

[11]  M. Junge,et al.  Noncommutative Bennett and Rosenthal inequalities , 2011, 1111.1027.

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

[13]  Vincent Duval,et al.  Sampling the Fourier Transform Along Radial Lines , 2016, SIAM J. Numer. Anal..

[14]  Laurent Jacques,et al.  Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors , 2011, IEEE Transactions on Information Theory.

[15]  Yonina C. Eldar,et al.  Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals , 2007, IEEE Transactions on Signal Processing.

[16]  G. Samorodnitsky Random series and stochastic integrals:single and multiple , 1994 .

[17]  S. Mendelson,et al.  Reconstruction and Subgaussian Operators in Asymptotic Geometric Analysis , 2007 .

[18]  Sjoerd Dirksen,et al.  Tail bounds via generic chaining , 2013, ArXiv.

[19]  F. Gamboa,et al.  Spike detection from inaccurate samplings , 2013, 1301.5873.

[20]  John D. Lafferty,et al.  Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent , 2016, ArXiv.

[21]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[22]  H. Landau Necessary density conditions for sampling and interpolation of certain entire functions , 1967 .

[23]  Emmanuel J. Cand Towards a Mathematical Theory of Super-Resolution , 2012 .

[24]  Christopher J. Hillar,et al.  Most Tensor Problems Are NP-Hard , 2009, JACM.

[25]  Parikshit Shah,et al.  Compressed Sensing Off the Grid , 2012, IEEE Transactions on Information Theory.

[26]  Y. Gordon On Milman's inequality and random subspaces which escape through a mesh in ℝ n , 1988 .

[27]  Ping Feng,et al.  Spectrum-blind minimum-rate sampling and reconstruction of multiband signals , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[28]  Martin J. Wainwright,et al.  Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees , 2015, ArXiv.

[29]  B. Carl Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces , 1985 .

[30]  Ping Feng,et al.  Universal Minimum-Rate Sampling and Spectrum-Blind Reconstruction for Multiband Signals , 1998 .

[31]  Peter L. Søndergaard,et al.  Efficient Algorithms for the Discrete Gabor Transform with a Long Fir Window , 2012 .

[32]  Massimo Fornasier,et al.  Theoretical Foundations and Numerical Methods for Sparse Recovery , 2010, Radon Series on Computational and Applied Mathematics.

[33]  N. Tomczak-Jaegermann Banach-Mazur distances and finite-dimensional operator ideals , 1989 .

[34]  S. Mendelson,et al.  Empirical processes and random projections , 2005 .

[35]  Roman Vershynin,et al.  High-Dimensional Probability , 2018 .

[36]  Pablo A. Parrilo,et al.  The Convex Geometry of Linear Inverse Problems , 2010, Foundations of Computational Mathematics.

[37]  Pierre Kornprobst,et al.  Can the Nonlocal Characterization of Sobolev Spaces by Bourgain et al. Be Useful for Solving Variational Problems? , 2009, SIAM J. Numer. Anal..

[38]  Mathews Jacob,et al.  Convex Recovery of Continuous Domain Piecewise Constant Images From Nonuniform Fourier Samples , 2017, IEEE Transactions on Signal Processing.

[39]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

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

[41]  V. N. Temlyakov,et al.  The Marcinkiewicz-Type Discretization Theorems , 2017, Constructive Approximation.

[42]  Rémi Gribonval,et al.  Stable recovery of low-dimensional cones in Hilbert spaces: One RIP to rule them all , 2015, Applied and Computational Harmonic Analysis.

[43]  U. Haagerup The best constants in the Khintchine inequality , 1981 .

[44]  Mathews Jacob,et al.  Off-the-Grid Recovery of Piecewise Constant Images from Few Fourier Samples , 2015, SIAM J. Imaging Sci..

[45]  Yonina C. Eldar,et al.  Xampling: Signal Acquisition and Processing in Union of Subspaces , 2009, IEEE Transactions on Signal Processing.

[46]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[47]  Jeffrey A. Fessler,et al.  Nonuniform fast Fourier transforms using min-max interpolation , 2003, IEEE Trans. Signal Process..