An Improved Analysis for Support Recovery With Orthogonal Matching Pursuit Under General Perturbations | Zendy

Haifeng Li | Zendy; Guoqi Liu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Improved Analysis for Support Recovery With Orthogonal Matching Pursuit Under General Perturbations

Author(s) -

Haifeng Li,

Guoqi Liu

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2018.2820804

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

Orthogonal matching pursuit (OMP) is a widely used greedy algorithm for recovering the support of a sparse signal x from the underdetermined model y = Ax. In practice, we should analyze the performance of OMP under general perturbations, which means that both y and A are perturbed. In this paper, under general perturbations, we present necessary and sufficient conditions for the exact support recovery with the OMP. We also discuss the performance of OMP for recovering α strongly decaying sparse signals. Typically, in the noise-free case, we show that the upper bound of our sufficient condition is unrelated with K and is a sharp bound. Furthermore, we establish sufficient conditions for the recovery of OMP, which can guarantee that the recovery is in the order of the signal entries' magnitude.

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

Accelerating Research