Multipath Matching Pursuit

DOI10.1109/TIT.2014.2310482MaRDI QIDQ6244260arXivWikidataFDO

Authors Suhyuk Kwon, Jian Wang, Byonghyo Shim

Publication date 22 August 2013

Published in arXiv

Full work available at URL https://doi.org/10.1109/TIT.2014.2310482

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

arXiv classification

cs.ITmath.IT

Abstract: In this paper, we propose an algorithm referred to as multipath matching pursuit 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 (RIP) based performance guarantee, we show that the proposed MMP algorithm is effective in reconstructing original sparse signals for both noiseless and noisy scenarios.

This page was built for publication: Multipath Matching Pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6244260)