Robustness of orthogonal matching pursuit under restricted isometry property  

作　　者：DAN Wei WANG RenHong 

机构地区：[1]School of Mathematics and Computational Sciences, Guangdong University of Business Studies [2]School of Mathematical Sciences, Dalian University of Technology

出　　处：《Science China Mathematics》2014年第3期627-634,共8页中国科学：数学（英文版）

基　　金：supported by National Natural Science Foundation of China(Grant Nos.11271060,U0935004,U1135003,11071031,11290143 and 11101096);the Scientific Research Foundation for the Returned Overseas Chinese Scholars,State Education Ministry,National Engineering Research Center of Digital Life;the Guangdong Natural Science Foundation(Grant No.S2012010010376)

摘　　要：Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the OMP algorithm under the restricted isometry property （RIP） is presented. It is shown that 5K＋V/KOK,1 〈 1 is sufficient for the OMP algorithm to recover exactly the support of arbitrary /（-sparse signal if its nonzero components are large enough for both 12 bounded and lz~ bounded noises.Orthogonal matching pursuit(OMP)algorithm is an efcient method for the recovery of a sparse signal in compressed sensing,due to its ease implementation and low complexity.In this paper,the robustness of the OMP algorithm under the restricted isometry property(RIP) is presented.It is shown that δK+√KθK,1<1is sufcient for the OMP algorithm to recover exactly the support of arbitrary K-sparse signal if its nonzero components are large enough for both l2bounded and l∞bounded noises.

关 键 词：compressed sensing orthogonal matching pursuit restricted isometry property 

分 类 号：TN911.7[电子电信—通信与信息系统]