IDEAS home Printed from https://ideas.repec.org/a/hin/jnljam/864132.html
   My bibliography  Save this article

Tree-Based Backtracking Orthogonal Matching Pursuit for Sparse Signal Reconstruction

Author

Listed:
  • Yigang Cen
  • Fangfei Wang
  • Ruizhen Zhao
  • Lihong Cui
  • Lihui Cen
  • Zhenjiang Miao
  • Yanming Cen

Abstract

Compressed sensing (CS) is a theory which exploits the sparsity characteristic of the original signal in signal sampling and coding. By solving an optimization problem, the original sparse signal can be reconstructed accurately. In this paper, a new Tree-based Backtracking Orthogonal Matching Pursuit (TBOMP) algorithm is presented with the idea of the tree model in wavelet domain. The algorithm can convert the wavelet tree structure to the corresponding relations of candidate atoms without any prior information of signal sparsity. Thus, the atom selection process will be more structural and the search space can be narrowed. Moreover, according to the backtracking process, the previous chosen atoms’ reliability can be detected and the unreliable atoms can be deleted at each iteration, which leads to an accurate reconstruction of the signal ultimately. Compared with other compressed sensing algorithms, simulation results show the proposed algorithm’s superior performance to that of several other OMP-type algorithms.

Suggested Citation

  • Yigang Cen & Fangfei Wang & Ruizhen Zhao & Lihong Cui & Lihui Cen & Zhenjiang Miao & Yanming Cen, 2013. "Tree-Based Backtracking Orthogonal Matching Pursuit for Sparse Signal Reconstruction," Journal of Applied Mathematics, Hindawi, vol. 2013, pages 1-8, November.
  • Handle: RePEc:hin:jnljam:864132
    DOI: 10.1155/2013/864132
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/JAM/2013/864132.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/JAM/2013/864132.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/864132?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:hin:jnljam:864132. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.