Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T19:29:45.488Z Has data issue: false hasContentIssue false

A Sharp Bound on RIC in Generalized Orthogonal Matching Pursuit

Published online by Cambridge University Press:  20 November 2018

Wengu Chen
Affiliation:
Institute of Applied Physics and Computational Mathematics, Beijing, 100088, China, e-mail: chenwg@iapcm.ac.cn
Huanmin Ge
Affiliation:
Graduate School, China Academy of Engineering Physics, Beijing, 100088, China, e-mail: gehuanmin@163.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The generalized orthogonal matching pursuit $\left( \text{gOMP} \right)$ algorithm has received much attention in recent years as a natural extension of the orthogonal matching pursuit $\left( \text{OMP} \right)$ . It is used to recover sparse signals in compressive sensing. In this paper, a new bound is obtained for the exact reconstruction of every $K$ -sparse signal via the $\text{gOMP}$ algorithm in the noiseless case. That is, if the restricted isometry constant $\left( \text{RIC} \right)$ ${{\delta }_{NK+1}}$ of the sensing matrix $A$ satisfies

${{\delta }_{NK+1}}\,<\frac{1}{\sqrt{\frac{K}{N}+\,1}},$

then the $\text{gOMP}$ can perfectly recover every $K$ -sparse signal $x$ from $y\,=\,Ax$ . Furthermore, the bound is proved to be sharp. In the noisy case, the above bound on $\text{RIC}$ combining with an extra condition on the minimum magnitude of the nonzero components of $K$ -sparse signals can guarantee that the $\text{gOMP}$ selects all of the support indices of the $K$ -sparse signals.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2018