Further results on stable recovery of sparse overcomplete representations in the presence of noise
IEEE Transactions on Information Theory
Restricted isometry constants where lpsparse recovery can fail for 0
IEEE Transactions on Information Theory
On recovery of sparse signals via l1 minimization
IEEE Transactions on Information Theory
Shifting inequality and recovery of sparse signals
IEEE Transactions on Signal Processing
Uncertainty principles and ideal atomic decomposition
IEEE Transactions on Information Theory
Sparse representations in unions of bases
IEEE Transactions on Information Theory
On sparse representations in arbitrary redundant bases
IEEE Transactions on Information Theory
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory
Recovery of exact sparse representations in the presence of bounded noise
IEEE Transactions on Information Theory
Decoding by linear programming
IEEE Transactions on Information Theory
Stable recovery of sparse overcomplete representations in the presence of noise
IEEE Transactions on Information Theory
New bounds for restricted isometry constants
IEEE Transactions on Information Theory
Coherence-based performance guarantees for estimating a sparse vector under random noise
IEEE Transactions on Signal Processing
Phase transition in limiting distributions of coherence of high-dimensional random matrices
Journal of Multivariate Analysis
| Hi-index | 754.90 |
This article considers sparse signal recovery in the presence of noise. A mutual incoherence condition which was previously used for exact recovery in the noiseless case is shown to be sufficient for stable recovery in the noisy case. Furthermore, the condition is proved to be sharp. A specific counterexample is given. In addition, an oracle inequality is derived under the mutual incoherence condition in the case of Gaussian noise.