Support Recovery With Orthogonal Matching Pursuit in the Presence of Noise

Support recovery of sparse signals from compressed linear measurements is a fundamental problem in compressed sensing (CS). In this article, we study the orthogonal matching pursuit (OMP) algorithm for the recovery of support under noise. We consider two signal-to-noise ratio (SNR) settings: 1) the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on signal processing Ročník 63; číslo 21; s. 5868 - 5877
Hlavný autor: Wang, Jian
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.11.2015
Predmet:
Algorithms
Compressed sensing
Compressed sensing (CS)
Constants
Error analysis
Matching
Matching pursuit algorithms
minimum-to-average ratio (MAR)
Noise
Noise measurement
orthogonal matching pursuit (OMP)
Recovery
restricted isometry property (RIP)
Signal processing algorithms
Signal to noise ratio
signal-to-noise ratio (SNR)
Sparse matrices
Transaction processing
ISSN:1053-587X, 1941-0476
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Support recovery of sparse signals from compressed linear measurements is a fundamental problem in compressed sensing (CS). In this article, we study the orthogonal matching pursuit (OMP) algorithm for the recovery of support under noise. We consider two signal-to-noise ratio (SNR) settings: 1) the SNR depends on the sparsity level K of input signals, and 2) the SNR is an absolute constant independent of K. For the first setting, we establish necessary and sufficient conditions for the exact support recovery with OMP, expressed as lower bounds on the SNR. Our results indicate that in order to ensure the exact support recovery of all K-sparse signals with the OMP algorithm, the SNR must at least scale linearly with the sparsity level K. In the second setting, since the necessary condition on the SNR is not fulfilled, the exact support recovery with OMP is impossible. However, our analysis shows that recovery with an arbitrarily small but constant fraction of errors is possible with the OMP algorithm. This result may be useful for some practical applications where obtaining some large fraction of support positions is adequate.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2015.2468676