文章基本信息

标题：Estimates of the Restricted Isometry Constant in Super Greedy Algorithms
本地全文：下载
作者：Wei Xiujie ; Ye Peixin
期刊名称：International Journal of Future Generation Communication and Networking
印刷版ISSN：2233-7857
出版年度：2015
卷号：8
期号：5
页码：137-144
DOI：10.14257/ijfgcn.2015.8.5.14
出版社：SERSC
摘要：Orthogonal Super Greedy Algorithm (OSGA) is a super greedy-type algorithm for sparse approximation. We analyze the convergence of OSGA based on Restricted Isometry Property (RIP). Our main conclusion is that if a matrix . satisfies the Restricted Isometry Property of order [ sK ] with isometry constant 2 sK s . . . , then OSGA ( s ) can exactly recover any K -sparse signal x from yx .. in at most K iterations.
关键词：Compressed Sensing; ; K ; -Sparse Signal; Orthogonal Multi Matching ; Pursuit; Orthogonal Super Greedy Algorithm; Restricted Isometry Constant