Compressive Sensing with Redundant Dictionaries and Structured Measurements
From MaRDI portal
Publication:3455237
DOI10.1137/151005245zbMath1345.94014arXiv1501.03208OpenAlexW2568623927MaRDI QIDQ3455237
Deanna Needell, Felix Krahmer, Rachel Ward
Publication date: 4 December 2015
Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.03208
Trigonometric approximation (42A10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Approximation by arbitrary linear expressions (41A45)
Related Items
Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames, Infinite dimensional compressed sensing from anisotropic measurements and applications to inverse problems in PDE, \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?, Sampling rates for \(\ell^1\)-synthesis, Compressive time-of-flight 3D imaging using block-structured sensing matrices, Preserving injectivity under subgaussian mappings and its application to compressed sensing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- A mathematical introduction to compressive sensing
- Restricted isometries for partial random circulant matrices
- Sparse Legendre expansions via \(\ell_1\)-minimization
- Super-resolution from noisy data
- Compressed sensing with coherent and redundant dictionaries
- Constructing tight fusion frames
- Sampling in the analysis transform domain
- Analysis \(\ell_1\)-recovery with frames and Gaussian measurements
- Interpolation via weighted \(\ell_{1}\) minimization
- Sparse directional image representations using the discrete shearlet transform
- A simple proof of the restricted isometry property for random matrices
- Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- The cosparse analysis model and algorithms
- Tight frames and their symmetries
- Near oracle performance and block analysis of signal space greedy methods
- Greedy signal space methods for incoherence and beyond
- Greedy-like algorithms for the cosparse analysis model
- Deterministic constructions of compressed sensing matrices
- A framelet-based image inpainting algorithm
- The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
- Stable Image Reconstruction Using Total Variation Minimization
- Suprema of Chaos Processes and the Restricted Isometry Property
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING
- On the Effective Measure of Dimension in the Analysis Cosparse Model
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- Johnson-Lindenstrauss lemma for circulant matrices**
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- On sparse reconstruction from Fourier and Gaussian measurements
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed Sensing and Redundant Dictionaries
- New tight frames of curvelets and optimal representations of objects with piecewise C2 singularities
- High-Resolution Radar via Compressed Sensing
- Sparse Estimation of Spectral Lines: Grid Selection Problems and Their Solutions
- Stable and Robust Sampling Strategies for Compressive Imaging
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Weighted Eigenfunction Estimates with Applications to Compressed Sensing
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- On the Role of Total Variation in Compressed Sensing
- Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis
- A Probabilistic and RIPless Theory of Compressed Sensing
- Optimally Sparse Frames
- Analysis versus synthesis in signal priors
- Sparsity and incoherence in compressive sampling
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
- Towards a Mathematical Theory of Super‐resolution
- Compressed sensing
