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)...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Japan journal of industrial and applied mathematics Ročník 41; číslo 2; s. 1277 - 1292
Hlavní autoři: Li, Haifeng, Guo, Leiyan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Tokyo Springer Japan 01.05.2024
Springer Nature B.V
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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).
Bibliografie: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