Exact reconstruction of sparse signals via generalized orthogonal matching pursuit

Jian Wang, Byonghyo Shim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

As a greedy algorithm recovering sparse signal from compressed measurements, orthogonal matching pursuit (OMP) algorithm have received much attention in recent years. The OMP selects at each step one index corresponding to the column that is most correlated with the current residual. In this paper, we present an extension of OMP for pursuing efficiency of the index selection. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple (N ∈ ℕ) columns are identified per step. We derive rigorous condition demonstrating that exact reconstruction of K-sparse (K > 1) signals is guaranteed for the gOMP algorithm if the sensing matrix satisfies the restricted isometric property (RIP) of order NK with isometric constant δ NK < √N/√K + 2 √N. In addition, empirical results demonstrate that the gOMP algorithm has very competitive reconstruction performance that is comparable to the ℓ 1-minimization technique.

Original languageEnglish
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
Pages1139-1142
Number of pages4
DOIs
Publication statusPublished - 2011 Dec 1
Event45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011 - Pacific Grove, CA, United States
Duration: 2011 Nov 62011 Nov 9

Other

Other45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011
CountryUnited States
CityPacific Grove, CA
Period11/11/611/11/9

Keywords

  • Compressed sensing (CS)
  • generalized orthogonal matching pursuit (gOMP)
  • restricted isometric property (RIP)

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Cite this

Wang, J., & Shim, B. (2011). Exact reconstruction of sparse signals via generalized orthogonal matching pursuit. In Conference Record - Asilomar Conference on Signals, Systems and Computers (pp. 1139-1142). [6190192] https://doi.org/10.1109/ACSSC.2011.6190192

Exact reconstruction of sparse signals via generalized orthogonal matching pursuit. / Wang, Jian; Shim, Byonghyo.

Conference Record - Asilomar Conference on Signals, Systems and Computers. 2011. p. 1139-1142 6190192.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, J & Shim, B 2011, Exact reconstruction of sparse signals via generalized orthogonal matching pursuit. in Conference Record - Asilomar Conference on Signals, Systems and Computers., 6190192, pp. 1139-1142, 45th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2011, Pacific Grove, CA, United States, 11/11/6. https://doi.org/10.1109/ACSSC.2011.6190192
Wang J, Shim B. Exact reconstruction of sparse signals via generalized orthogonal matching pursuit. In Conference Record - Asilomar Conference on Signals, Systems and Computers. 2011. p. 1139-1142. 6190192 https://doi.org/10.1109/ACSSC.2011.6190192
Wang, Jian ; Shim, Byonghyo. / Exact reconstruction of sparse signals via generalized orthogonal matching pursuit. Conference Record - Asilomar Conference on Signals, Systems and Computers. 2011. pp. 1139-1142
@inproceedings{e0b502058b0d43fd999cb6002eef28a5,
title = "Exact reconstruction of sparse signals via generalized orthogonal matching pursuit",
abstract = "As a greedy algorithm recovering sparse signal from compressed measurements, orthogonal matching pursuit (OMP) algorithm have received much attention in recent years. The OMP selects at each step one index corresponding to the column that is most correlated with the current residual. In this paper, we present an extension of OMP for pursuing efficiency of the index selection. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple (N ∈ ℕ) columns are identified per step. We derive rigorous condition demonstrating that exact reconstruction of K-sparse (K > 1) signals is guaranteed for the gOMP algorithm if the sensing matrix satisfies the restricted isometric property (RIP) of order NK with isometric constant δ NK < √N/√K + 2 √N. In addition, empirical results demonstrate that the gOMP algorithm has very competitive reconstruction performance that is comparable to the ℓ 1-minimization technique.",
keywords = "Compressed sensing (CS), generalized orthogonal matching pursuit (gOMP), restricted isometric property (RIP)",
author = "Jian Wang and Byonghyo Shim",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ACSSC.2011.6190192",
language = "English",
isbn = "9781467303231",
pages = "1139--1142",
booktitle = "Conference Record - Asilomar Conference on Signals, Systems and Computers",

}

TY - GEN

T1 - Exact reconstruction of sparse signals via generalized orthogonal matching pursuit

AU - Wang, Jian

AU - Shim, Byonghyo

PY - 2011/12/1

Y1 - 2011/12/1

N2 - As a greedy algorithm recovering sparse signal from compressed measurements, orthogonal matching pursuit (OMP) algorithm have received much attention in recent years. The OMP selects at each step one index corresponding to the column that is most correlated with the current residual. In this paper, we present an extension of OMP for pursuing efficiency of the index selection. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple (N ∈ ℕ) columns are identified per step. We derive rigorous condition demonstrating that exact reconstruction of K-sparse (K > 1) signals is guaranteed for the gOMP algorithm if the sensing matrix satisfies the restricted isometric property (RIP) of order NK with isometric constant δ NK < √N/√K + 2 √N. In addition, empirical results demonstrate that the gOMP algorithm has very competitive reconstruction performance that is comparable to the ℓ 1-minimization technique.

AB - As a greedy algorithm recovering sparse signal from compressed measurements, orthogonal matching pursuit (OMP) algorithm have received much attention in recent years. The OMP selects at each step one index corresponding to the column that is most correlated with the current residual. In this paper, we present an extension of OMP for pursuing efficiency of the index selection. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple (N ∈ ℕ) columns are identified per step. We derive rigorous condition demonstrating that exact reconstruction of K-sparse (K > 1) signals is guaranteed for the gOMP algorithm if the sensing matrix satisfies the restricted isometric property (RIP) of order NK with isometric constant δ NK < √N/√K + 2 √N. In addition, empirical results demonstrate that the gOMP algorithm has very competitive reconstruction performance that is comparable to the ℓ 1-minimization technique.

KW - Compressed sensing (CS)

KW - generalized orthogonal matching pursuit (gOMP)

KW - restricted isometric property (RIP)

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

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

U2 - 10.1109/ACSSC.2011.6190192

DO - 10.1109/ACSSC.2011.6190192

M3 - Conference contribution

SN - 9781467303231

SP - 1139

EP - 1142

BT - Conference Record - Asilomar Conference on Signals, Systems and Computers

ER -