z-logo
open-access-imgOpen Access
Analysis of generalised orthogonal matching pursuit using restricted isometry constant
Author(s) -
Shen Yi,
Li Bo,
Pan Wenlei,
Li Jia
Publication year - 2014
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2014.1012
Subject(s) - matching pursuit , isometry (riemannian geometry) , restricted isometry property , constant (computer programming) , compressed sensing , algorithm , matching (statistics) , mathematics , signal (programming language) , signal reconstruction , computer science , mathematical optimization , signal processing , mathematical analysis , telecommunications , statistics , radar , programming language
In compressive sensing, the generalised orthogonal matching pursuit (gOMP) algorithm is one kind of sparse signal recovery algorithm, which generalises the OMP algorithm by selecting a fixed number of atoms at each iteration. Restricted isometry constant‐based sufficient conditions to guarantee the correct support identification and the successful recovery of a sparse signal using the gOMP algorithm in a noiseless case are proposed. The proposed sufficient bounds are more relaxed compared with the existing ones.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here