Sparse Signal Recovery by Stepwise Subspace Pursuit in Compressed Sensing

ZheTao Li, JingXiong Xie, DengBiao Tu and Young-June Choi

International Journal of Distributed Sensor Networks, 2013, vol. 9, issue 8, 798537

Abstract: In this paper, an algorithm named stepwise subspace pursuit (SSP) is proposed for sparse signal recovery. Unlike existing algorithms that select support set from candidate sets directly, our approach eliminates useless information from the candidate through threshold processing at first and then recovers the signal through the largest correlation coefficients. We demonstrate that SSP significantly outperforms conventional techniques in recovering sparse signals whose nonzero values have exponentially decaying magnitudes or distribution of N ( 0,1 ) . Experimental results of Lena show that SSP is better than CoSaMP, OMP, and SP in terms of peak signal to noise ratio (PSNR) by 5.5 db, 4.1 db, and 4.2 db, respectively.

Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2013/798537 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:9:y:2013:i:8:p:798537

DOI: 10.1155/2013/798537

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().