Recovery of sparse signals via generalized orthogonal matching pursuit

A new analysis

Jian Wang, Suhyuk Kwon, Ping Li, Byonghyo Shim

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

As an extension of orthogonal matching pursuit (OMP) for improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm using the restricted isometry property (RIP). We show that if a measurement matrix Φ ∈ Rm×n satisfies the RIP with isometry constant δmax{9,S+1}K ≤ 1/8, then gOMP performs stable reconstruction of all K-sparse signals x ∈ Rn from the noisy measurements y=Φ x+ v, within {K,⌊8K/S⌋ iterations, where v is the noise vector and S is the number of indices chosen in each iteration of the gOMP algorithm. For Gaussian random measurements, our result indicates that the number of required measurements is essentially m= O(K log n/K), which is a significant improvement over the existing result m= O(K2 log n/K), especially for large K.

Original languageEnglish
Article number7321045
Pages (from-to)1076-1089
Number of pages14
JournalIEEE Transactions on Signal Processing
Volume64
Issue number4
DOIs
Publication statusPublished - 2016 Feb 15
Externally publishedYes

Fingerprint

Recovery

Keywords

  • Compressed Sensing (CS)
  • Generalized Orthogonal Matching Pursuit (gOMP)
  • Mean Square Error (MSE)
  • Restricted Isometry Property (RIP)
  • sparse recovery
  • stability

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Recovery of sparse signals via generalized orthogonal matching pursuit : A new analysis. / Wang, Jian; Kwon, Suhyuk; Li, Ping; Shim, Byonghyo.

In: IEEE Transactions on Signal Processing, Vol. 64, No. 4, 7321045, 15.02.2016, p. 1076-1089.

Research output: Contribution to journalArticle

@article{51d96d0ef46a480ab2c973d7d0b0e48a,
title = "Recovery of sparse signals via generalized orthogonal matching pursuit: A new analysis",
abstract = "As an extension of orthogonal matching pursuit (OMP) for improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm using the restricted isometry property (RIP). We show that if a measurement matrix Φ ∈ Rm×n satisfies the RIP with isometry constant δmax{9,S+1}K ≤ 1/8, then gOMP performs stable reconstruction of all K-sparse signals x ∈ Rn from the noisy measurements y=Φ x+ v, within {K,⌊8K/S⌋ iterations, where v is the noise vector and S is the number of indices chosen in each iteration of the gOMP algorithm. For Gaussian random measurements, our result indicates that the number of required measurements is essentially m= O(K log n/K), which is a significant improvement over the existing result m= O(K2 log n/K), especially for large K.",
keywords = "Compressed Sensing (CS), Generalized Orthogonal Matching Pursuit (gOMP), Mean Square Error (MSE), Restricted Isometry Property (RIP), sparse recovery, stability",
author = "Jian Wang and Suhyuk Kwon and Ping Li and Byonghyo Shim",
year = "2016",
month = "2",
day = "15",
doi = "10.1109/TSP.2015.2498132",
language = "English",
volume = "64",
pages = "1076--1089",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Recovery of sparse signals via generalized orthogonal matching pursuit

T2 - A new analysis

AU - Wang, Jian

AU - Kwon, Suhyuk

AU - Li, Ping

AU - Shim, Byonghyo

PY - 2016/2/15

Y1 - 2016/2/15

N2 - As an extension of orthogonal matching pursuit (OMP) for improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm using the restricted isometry property (RIP). We show that if a measurement matrix Φ ∈ Rm×n satisfies the RIP with isometry constant δmax{9,S+1}K ≤ 1/8, then gOMP performs stable reconstruction of all K-sparse signals x ∈ Rn from the noisy measurements y=Φ x+ v, within {K,⌊8K/S⌋ iterations, where v is the noise vector and S is the number of indices chosen in each iteration of the gOMP algorithm. For Gaussian random measurements, our result indicates that the number of required measurements is essentially m= O(K log n/K), which is a significant improvement over the existing result m= O(K2 log n/K), especially for large K.

AB - As an extension of orthogonal matching pursuit (OMP) for improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm using the restricted isometry property (RIP). We show that if a measurement matrix Φ ∈ Rm×n satisfies the RIP with isometry constant δmax{9,S+1}K ≤ 1/8, then gOMP performs stable reconstruction of all K-sparse signals x ∈ Rn from the noisy measurements y=Φ x+ v, within {K,⌊8K/S⌋ iterations, where v is the noise vector and S is the number of indices chosen in each iteration of the gOMP algorithm. For Gaussian random measurements, our result indicates that the number of required measurements is essentially m= O(K log n/K), which is a significant improvement over the existing result m= O(K2 log n/K), especially for large K.

KW - Compressed Sensing (CS)

KW - Generalized Orthogonal Matching Pursuit (gOMP)

KW - Mean Square Error (MSE)

KW - Restricted Isometry Property (RIP)

KW - sparse recovery

KW - stability

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

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

U2 - 10.1109/TSP.2015.2498132

DO - 10.1109/TSP.2015.2498132

M3 - Article

VL - 64

SP - 1076

EP - 1089

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 4

M1 - 7321045

ER -