Theoretical analysis of GOMP based on RIP and ROC

This paper aims to investigate sufficient conditions for the recovery of sparse signals via the generalized orthogonal matching pursuit (gOMP) algorithm. In the noisy case, a sufficient condition for recovering the support of k -sparse signal is presented based on restricted isometry property (RIP)...

Full description

Saved in:
Bibliographic Details
Published in:Japan journal of industrial and applied mathematics Vol. 41; no. 2; pp. 1277 - 1292
Main Authors: Li, Haifeng, Guo, Leiyan
Format: Journal Article
Language:English
Published: Tokyo Springer Japan 01.05.2024
Springer Nature B.V
Subjects:
Algorithms
Applications of Mathematics
Computational Mathematics and Numerical Analysis
Guarantees
Matched pursuit
Mathematics
Mathematics and Statistics
Original Paper
Orthogonality
Success
68W40
Restricted isometry property
Restricted orthogonality constant
Greedy algorithm
65J22
65D15
Compressed sensing
ISSN:0916-7005, 1868-937X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper aims to investigate sufficient conditions for the recovery of sparse signals via the generalized orthogonal matching pursuit (gOMP) algorithm. In the noisy case, a sufficient condition for recovering the support of k -sparse signal is presented based on restricted isometry property (RIP) and restricted orthogonality constant (ROC).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0916-7005
1868-937X
DOI:10.1007/s13160-024-00651-9