Sparse signal recovery via multipath matching pursuit

Suhyuk Kwon, Jian Wang, Byonghyo Shim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose a sparse recovery algorithm, termed multiple path matching pursuit (MMP), that improves the recovery performance of sparse signals. By investigating the multiple paths and then choosing the most promising path in the final moment, the MMP algorithm improves the chance of finding the true support and therefore enhances the recovery performance. From the restricted isometry property (RIP) analysis, we show that the MMP algorithm can perfectly reconstruct any K-sparse (K >1) signals, provided that the sensing matrix satisfies RIP with δK+L < √ L/√ K +3√ L. We demonstrate by empirical simulations that the MMP algorithm is very competitive in both noisy and noiseless scenarios.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages854-858
Number of pages5
DOIs
Publication statusPublished - 2013 Dec 19
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 2013 Jul 72013 Jul 12

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period13/7/713/7/12

Fingerprint

Matching Pursuit
Multipath
Recovery
Path
Isometry
Sensing
Moment
Scenarios
Demonstrate
Simulation

ASJC Scopus subject areas

  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Kwon, S., Wang, J., & Shim, B. (2013). Sparse signal recovery via multipath matching pursuit. In IEEE International Symposium on Information Theory - Proceedings (pp. 854-858). [6620347] https://doi.org/10.1109/ISIT.2013.6620347

Sparse signal recovery via multipath matching pursuit. / Kwon, Suhyuk; Wang, Jian; Shim, Byonghyo.

IEEE International Symposium on Information Theory - Proceedings. 2013. p. 854-858 6620347.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kwon, S, Wang, J & Shim, B 2013, Sparse signal recovery via multipath matching pursuit. in IEEE International Symposium on Information Theory - Proceedings., 6620347, pp. 854-858, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 13/7/7. https://doi.org/10.1109/ISIT.2013.6620347
Kwon S, Wang J, Shim B. Sparse signal recovery via multipath matching pursuit. In IEEE International Symposium on Information Theory - Proceedings. 2013. p. 854-858. 6620347 https://doi.org/10.1109/ISIT.2013.6620347
Kwon, Suhyuk ; Wang, Jian ; Shim, Byonghyo. / Sparse signal recovery via multipath matching pursuit. IEEE International Symposium on Information Theory - Proceedings. 2013. pp. 854-858
@inproceedings{7699fd8cef5e476e92436762a9a27653,
title = "Sparse signal recovery via multipath matching pursuit",
abstract = "In this paper, we propose a sparse recovery algorithm, termed multiple path matching pursuit (MMP), that improves the recovery performance of sparse signals. By investigating the multiple paths and then choosing the most promising path in the final moment, the MMP algorithm improves the chance of finding the true support and therefore enhances the recovery performance. From the restricted isometry property (RIP) analysis, we show that the MMP algorithm can perfectly reconstruct any K-sparse (K >1) signals, √provided that the sensing matrix satisfies RIP with δK+L < √ L/√ K +3√ L. We demonstrate by empirical simulations that the MMP algorithm is very competitive in both noisy and noiseless scenarios.",
author = "Suhyuk Kwon and Jian Wang and Byonghyo Shim",
year = "2013",
month = "12",
day = "19",
doi = "10.1109/ISIT.2013.6620347",
language = "English",
isbn = "9781479904464",
pages = "854--858",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Sparse signal recovery via multipath matching pursuit

AU - Kwon, Suhyuk

AU - Wang, Jian

AU - Shim, Byonghyo

PY - 2013/12/19

Y1 - 2013/12/19

N2 - In this paper, we propose a sparse recovery algorithm, termed multiple path matching pursuit (MMP), that improves the recovery performance of sparse signals. By investigating the multiple paths and then choosing the most promising path in the final moment, the MMP algorithm improves the chance of finding the true support and therefore enhances the recovery performance. From the restricted isometry property (RIP) analysis, we show that the MMP algorithm can perfectly reconstruct any K-sparse (K >1) signals, √provided that the sensing matrix satisfies RIP with δK+L < √ L/√ K +3√ L. We demonstrate by empirical simulations that the MMP algorithm is very competitive in both noisy and noiseless scenarios.

AB - In this paper, we propose a sparse recovery algorithm, termed multiple path matching pursuit (MMP), that improves the recovery performance of sparse signals. By investigating the multiple paths and then choosing the most promising path in the final moment, the MMP algorithm improves the chance of finding the true support and therefore enhances the recovery performance. From the restricted isometry property (RIP) analysis, we show that the MMP algorithm can perfectly reconstruct any K-sparse (K >1) signals, √provided that the sensing matrix satisfies RIP with δK+L < √ L/√ K +3√ L. We demonstrate by empirical simulations that the MMP algorithm is very competitive in both noisy and noiseless scenarios.

UR - http://www.scopus.com/inward/record.url?scp=84890414239&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890414239&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2013.6620347

DO - 10.1109/ISIT.2013.6620347

M3 - Conference contribution

AN - SCOPUS:84890414239

SN - 9781479904464

SP - 854

EP - 858

BT - IEEE International Symposium on Information Theory - Proceedings

ER -