Preserving injectivity under subgaussian mappings and its application to compressed sensing
From MaRDI portal
Publication:778017
DOI10.1016/j.acha.2020.05.006zbMath1448.94053arXiv1710.09972OpenAlexW3030280132WikidataQ122887637 ScholiaQ122887637MaRDI QIDQ778017
Richard G. Lynch, Xuemei Chen, Peter G. Casazza
Publication date: 30 June 2020
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.09972
Computational methods for problems pertaining to statistics (62-08) Inequalities; stochastic orderings (60E15) Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Randomized algorithms (68W20)
Related Items
Sampling rates for \(\ell^1\)-synthesis, Signal separation under coherent dictionaries and \(\ell_p\)-bounded noise
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The gap between the null space property and the restricted isometry property
- A mathematical introduction to compressive sensing
- Perturbations of measurement matrices and dictionaries in compressed sensing
- Finite frames. Theory and applications.
- Orthogonal matching pursuit under the restricted isometry property
- Sparse recovery under weak moment assumptions
- Compressed sensing with coherent and redundant dictionaries
- Explicit constructions of RIP matrices and related problems
- Instance-optimality in probability with an \(\ell _1\)-minimization decoder
- A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Improved bounds for sparse recovery from subsampled random convolutions
- The convex geometry of linear inverse problems
- Full spark frames
- Analysis of inpainting via clustered sparsity and microlocal analysis
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries
- Atomic Decomposition by Basis Pursuit
- Estimation in High Dimensions: A Geometric Perspective
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Compressive Sensing with Redundant Dictionaries and Structured Measurements
- Bounding the Smallest Singular Value of a Random Matrix Without Concentration
- On sparse reconstruction from Fourier and Gaussian measurements
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed Sensing and Redundant Dictionaries
- High-dimensional estimation with geometric constraints: Table 1.
- Flavors of Compressive Sensing
- On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
- Robust Width: A Characterization of Uniformly Stable and Robust Compressed Sensing
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Upper and Lower Bounds for Stochastic Processes
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- A brief introduction to Hilbert space frame theory and its applications
- Dictionary-sparse recovery via thresholding-based algorithms
