Oblique Projection Matching Pursuit

Jian Wang, Feng Wang, Yunquan Dong, Byonghyo Shim

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is preserved in the residual vector. Further, to improve the information preservation, we present a modification of OMP, called oblique projection matching pursuit (ObMP), which updates the residual in a oblique projection manor. Using the restricted isometric property (RIP), we build a solid yet very intuitive grasp of the more accurate phenomenon of ObMP. We also show from empirical experiments that the ObMP achieves improved reconstruction performance over the conventional OMP algorithm in terms of support detection ratio and mean squared error (MSE).

Original languageEnglish
Pages (from-to)1-6
Number of pages6
JournalMobile Networks and Applications
DOIs
Publication statusAccepted/In press - 2016 Nov 22
Externally publishedYes

Fingerprint

Compressed sensing
Experiments

Keywords

  • Compressed sensing (CS)
  • Orthogonal matching pursuit (OMP)
  • Restricted isometry property (RIP)
  • Sparse recovery

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Oblique Projection Matching Pursuit. / Wang, Jian; Wang, Feng; Dong, Yunquan; Shim, Byonghyo.

In: Mobile Networks and Applications, 22.11.2016, p. 1-6.

Research output: Contribution to journalArticle

Wang, Jian ; Wang, Feng ; Dong, Yunquan ; Shim, Byonghyo. / Oblique Projection Matching Pursuit. In: Mobile Networks and Applications. 2016 ; pp. 1-6.
@article{78075807af1f43bfb8148c4b8199006d,
title = "Oblique Projection Matching Pursuit",
abstract = "Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is preserved in the residual vector. Further, to improve the information preservation, we present a modification of OMP, called oblique projection matching pursuit (ObMP), which updates the residual in a oblique projection manor. Using the restricted isometric property (RIP), we build a solid yet very intuitive grasp of the more accurate phenomenon of ObMP. We also show from empirical experiments that the ObMP achieves improved reconstruction performance over the conventional OMP algorithm in terms of support detection ratio and mean squared error (MSE).",
keywords = "Compressed sensing (CS), Orthogonal matching pursuit (OMP), Restricted isometry property (RIP), Sparse recovery",
author = "Jian Wang and Feng Wang and Yunquan Dong and Byonghyo Shim",
year = "2016",
month = "11",
day = "22",
doi = "10.1007/s11036-016-0773-x",
language = "English",
pages = "1--6",
journal = "Mobile Networks and Applications",
issn = "1383-469X",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Oblique Projection Matching Pursuit

AU - Wang, Jian

AU - Wang, Feng

AU - Dong, Yunquan

AU - Shim, Byonghyo

PY - 2016/11/22

Y1 - 2016/11/22

N2 - Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is preserved in the residual vector. Further, to improve the information preservation, we present a modification of OMP, called oblique projection matching pursuit (ObMP), which updates the residual in a oblique projection manor. Using the restricted isometric property (RIP), we build a solid yet very intuitive grasp of the more accurate phenomenon of ObMP. We also show from empirical experiments that the ObMP achieves improved reconstruction performance over the conventional OMP algorithm in terms of support detection ratio and mean squared error (MSE).

AB - Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is preserved in the residual vector. Further, to improve the information preservation, we present a modification of OMP, called oblique projection matching pursuit (ObMP), which updates the residual in a oblique projection manor. Using the restricted isometric property (RIP), we build a solid yet very intuitive grasp of the more accurate phenomenon of ObMP. We also show from empirical experiments that the ObMP achieves improved reconstruction performance over the conventional OMP algorithm in terms of support detection ratio and mean squared error (MSE).

KW - Compressed sensing (CS)

KW - Orthogonal matching pursuit (OMP)

KW - Restricted isometry property (RIP)

KW - Sparse recovery

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

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

U2 - 10.1007/s11036-016-0773-x

DO - 10.1007/s11036-016-0773-x

M3 - Article

SP - 1

EP - 6

JO - Mobile Networks and Applications

JF - Mobile Networks and Applications

SN - 1383-469X

ER -