In this letter, parallel orthogonal matching pursuit (POMP) is proposed to supplement orthogonal matching pursuit (OMP) which has been widely used as a greedy algorithm for sparse signal recovery. Empirical simulations show that POMP outperforms the existing sparse signal recovery algorithms including OMP, compressive sampling matching pursuit (CoSaMP), and linear programming (LP) in terms of the exact recovery ratio (ERR) for the sparse pattern and the mean-squared error (MSE) between the estimated signal and the original signal.
Shin-Woong PARK
Korea University
Jeonghong PARK
Gyeongsang National University
Bang Chul JUNG
Gyeongsang National University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shin-Woong PARK, Jeonghong PARK, Bang Chul JUNG, "On the Sparse Signal Recovery with Parallel Orthogonal Matching Pursuit" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 12, pp. 2728-2730, December 2013, doi: 10.1587/transfun.E96.A.2728.
Abstract: In this letter, parallel orthogonal matching pursuit (POMP) is proposed to supplement orthogonal matching pursuit (OMP) which has been widely used as a greedy algorithm for sparse signal recovery. Empirical simulations show that POMP outperforms the existing sparse signal recovery algorithms including OMP, compressive sampling matching pursuit (CoSaMP), and linear programming (LP) in terms of the exact recovery ratio (ERR) for the sparse pattern and the mean-squared error (MSE) between the estimated signal and the original signal.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.2728/_p
Copy
@ARTICLE{e96-a_12_2728,
author={Shin-Woong PARK, Jeonghong PARK, Bang Chul JUNG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Sparse Signal Recovery with Parallel Orthogonal Matching Pursuit},
year={2013},
volume={E96-A},
number={12},
pages={2728-2730},
abstract={In this letter, parallel orthogonal matching pursuit (POMP) is proposed to supplement orthogonal matching pursuit (OMP) which has been widely used as a greedy algorithm for sparse signal recovery. Empirical simulations show that POMP outperforms the existing sparse signal recovery algorithms including OMP, compressive sampling matching pursuit (CoSaMP), and linear programming (LP) in terms of the exact recovery ratio (ERR) for the sparse pattern and the mean-squared error (MSE) between the estimated signal and the original signal.},
keywords={},
doi={10.1587/transfun.E96.A.2728},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - On the Sparse Signal Recovery with Parallel Orthogonal Matching Pursuit
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2728
EP - 2730
AU - Shin-Woong PARK
AU - Jeonghong PARK
AU - Bang Chul JUNG
PY - 2013
DO - 10.1587/transfun.E96.A.2728
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2013
AB - In this letter, parallel orthogonal matching pursuit (POMP) is proposed to supplement orthogonal matching pursuit (OMP) which has been widely used as a greedy algorithm for sparse signal recovery. Empirical simulations show that POMP outperforms the existing sparse signal recovery algorithms including OMP, compressive sampling matching pursuit (CoSaMP), and linear programming (LP) in terms of the exact recovery ratio (ERR) for the sparse pattern and the mean-squared error (MSE) between the estimated signal and the original signal.
ER -