Near oracle performance and block analysis of signal space greedy methods
From MaRDI portal
Publication:2344305
DOI10.1016/j.jat.2015.02.007zbMath1381.94049arXiv1402.2601MaRDI QIDQ2344305
Publication date: 13 May 2015
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.2601
sparse approximation; compressed sensing; restricted isometry property; block sparsity; coherent dictionaries; signal space methods
62H12: Estimation in multivariate analysis
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
94A20: Sampling theory in information and communication theory
Related Items
Image reconstruction using analysis model prior, Sparsity Based Methods for Overparameterized Variational Problems, Compressive Sensing with Redundant Dictionaries and Structured Measurements
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Compressed sensing with coherent and redundant dictionaries
- Iterative hard thresholding for compressed sensing
- A null space analysis of the \(\ell_1\)-synthesis method in dictionary-based compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Uniform uncertainty principle for Bernoulli and subgaussian ensembles
- Global versus local asymptotic theories of finite-dimensional normed spaces
- Greedy signal space methods for incoherence and beyond
- Simultaneous analysis of Lasso and Dantzig selector
- Greedy-like algorithms for the cosparse analysis model
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Sparse Recovery Algorithms: Sufficient Conditions in Terms of Restricted Isometry Constants
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Modern statistical estimation via oracle inequalities
- Sparsity Based Methods for Overparameterized Variational Problems
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Compressed Sensing and Redundant Dictionaries
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT
- Matching pursuits with time-frequency dictionaries
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Model-Based Compressive Sensing
- Analysis versus synthesis in signal priors
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Stable signal recovery from incomplete and inaccurate measurements
