IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i8p798537.html
   My bibliography  Save this article

Sparse Signal Recovery by Stepwise Subspace Pursuit in Compressed Sensing

Author

Listed:
  • ZheTao Li
  • JingXiong Xie
  • DengBiao Tu
  • Young-June Choi

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.

Suggested Citation

  • ZheTao Li & JingXiong Xie & DengBiao Tu & Young-June Choi, 2013. "Sparse Signal Recovery by Stepwise Subspace Pursuit in Compressed Sensing," International Journal of Distributed Sensor Networks, , vol. 9(8), pages 798537-7985, August.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:8:p:798537
    DOI: 10.1155/2013/798537
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/798537
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/798537?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:8:p:798537. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.