Preconditioning for orthogonal matching pursuit with noisy and random measurements: the Gaussian case
From MaRDI portal
Publication:2338338
DOI10.1007/s00034-017-0730-3zbMath1425.94028OpenAlexW2777957901MaRDI QIDQ2338338
Yingtong Chen, Ji-Gen Peng, Shi-Gang Yue
Publication date: 21 November 2019
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00034-017-0730-3
Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- On the conditioning of random subdictionaries
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse and Redundant Representations
- Dictionary Preconditioning for Greedy Algorithms
- Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Influences of preconditioning on the mutual coherence and the restricted isometry property of Gaussian/Bernoulli measurement matrices