Greedy signal space methods for incoherence and beyond
From MaRDI portal
Publication:2347895
DOI10.1016/j.acha.2014.07.004zbMath1345.94025arXiv1309.2676OpenAlexW2962817023MaRDI QIDQ2347895
Publication date: 10 June 2015
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2676
algorithmsapproximationsparse approximationcompressed sensingrestricted isometry propertysparse modelingCoSaMPcoherent dictionariessignal space methods
Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Related Items
Sparsity Based Methods for Overparameterized Variational Problems, Compressive Sensing with Redundant Dictionaries and Structured Measurements, Generalizing CoSaMP to signals from a union of low dimensional linear subspaces, Sampling in the analysis transform domain, Dictionary-sparse recovery via thresholding-based algorithms, Near oracle performance and block analysis of signal space greedy methods
Uses Software
Cites Work
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Compressed sensing with coherent and redundant dictionaries
- Iterative hard thresholding for compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- The cosparse analysis model and algorithms
- Spectral compressive sensing
- Greedy-like algorithms for the cosparse analysis model
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Stable Image Reconstruction Using Total Variation Minimization
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Coherence Pattern–Guided Compressive Sensing with Unresolved Grids
- Robust Sparse Analysis Regularization
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Sparse and Redundant Representations
- Compressed Sensing and Redundant Dictionaries
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Model-Based Compressive Sensing
- Analysis versus synthesis in signal priors
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Approximation-Tolerant Model-Based Compressive Sensing
- Towards a Mathematical Theory of Super‐resolution
- Stable signal recovery from incomplete and inaccurate measurements
- Adaptive greedy approximations
