Multipath matching pursuit

Suhyuk Kwon, Jian Wang, Byonghyo Shim

Research output: Contribution to journalArticle

77 Citations (Scopus)

Abstract

In this paper, we propose an algorithm referred to as multipath matching pursuit (MMP) that investigates multiple promising candidates to recover sparse signals from compressed measurements. Our method is inspired by the fact that the problem to find the candidate that minimizes the residual is readily modeled as a combinatoric tree search problem and the greedy search strategy is a good fit for solving this problem. In the empirical results as well as the restricted isometry property-based performance guarantee, we show that the proposed MMP algorithm is effective in reconstructing original sparse signals for both noiseless and noisy scenarios.

Original languageEnglish
Article number6762942
Pages (from-to)2986-3001
Number of pages16
JournalIEEE Transactions on Information Theory
Volume60
Issue number5
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

candidacy
guarantee
scenario
performance

Keywords

  • Compressive sensing (CS)
  • greedy algorithm
  • Oracle estimator
  • orthogonal matching pursuit
  • restricted isometry property (RIP)
  • sparse signal recovery

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Multipath matching pursuit. / Kwon, Suhyuk; Wang, Jian; Shim, Byonghyo.

In: IEEE Transactions on Information Theory, Vol. 60, No. 5, 6762942, 01.01.2014, p. 2986-3001.

Research output: Contribution to journalArticle

Kwon, Suhyuk ; Wang, Jian ; Shim, Byonghyo. / Multipath matching pursuit. In: IEEE Transactions on Information Theory. 2014 ; Vol. 60, No. 5. pp. 2986-3001.
@article{b1ed5bda8e2742718fa19931a5b2de7b,
title = "Multipath matching pursuit",
abstract = "In this paper, we propose an algorithm referred to as multipath matching pursuit (MMP) that investigates multiple promising candidates to recover sparse signals from compressed measurements. Our method is inspired by the fact that the problem to find the candidate that minimizes the residual is readily modeled as a combinatoric tree search problem and the greedy search strategy is a good fit for solving this problem. In the empirical results as well as the restricted isometry property-based performance guarantee, we show that the proposed MMP algorithm is effective in reconstructing original sparse signals for both noiseless and noisy scenarios.",
keywords = "Compressive sensing (CS), greedy algorithm, Oracle estimator, orthogonal matching pursuit, restricted isometry property (RIP), sparse signal recovery",
author = "Suhyuk Kwon and Jian Wang and Byonghyo Shim",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TIT.2014.2310482",
language = "English",
volume = "60",
pages = "2986--3001",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Multipath matching pursuit

AU - Kwon, Suhyuk

AU - Wang, Jian

AU - Shim, Byonghyo

PY - 2014/1/1

Y1 - 2014/1/1

N2 - In this paper, we propose an algorithm referred to as multipath matching pursuit (MMP) that investigates multiple promising candidates to recover sparse signals from compressed measurements. Our method is inspired by the fact that the problem to find the candidate that minimizes the residual is readily modeled as a combinatoric tree search problem and the greedy search strategy is a good fit for solving this problem. In the empirical results as well as the restricted isometry property-based performance guarantee, we show that the proposed MMP algorithm is effective in reconstructing original sparse signals for both noiseless and noisy scenarios.

AB - In this paper, we propose an algorithm referred to as multipath matching pursuit (MMP) that investigates multiple promising candidates to recover sparse signals from compressed measurements. Our method is inspired by the fact that the problem to find the candidate that minimizes the residual is readily modeled as a combinatoric tree search problem and the greedy search strategy is a good fit for solving this problem. In the empirical results as well as the restricted isometry property-based performance guarantee, we show that the proposed MMP algorithm is effective in reconstructing original sparse signals for both noiseless and noisy scenarios.

KW - Compressive sensing (CS)

KW - greedy algorithm

KW - Oracle estimator

KW - orthogonal matching pursuit

KW - restricted isometry property (RIP)

KW - sparse signal recovery

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

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

U2 - 10.1109/TIT.2014.2310482

DO - 10.1109/TIT.2014.2310482

M3 - Article

AN - SCOPUS:84899650227

VL - 60

SP - 2986

EP - 3001

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 5

M1 - 6762942

ER -