Piecewise Sparse Recovery via Piecewise Greedy Method
Received:June 07, 2018  Revised:September 14, 2018
Key Words: piecewise sparse   OMP   greedy algorithms  
Fund Project:Supported by the National Natural Science Foundation of China (Grant Nos.11471066; 11572081; 11871137) and the Fundamental Research Funds for the Central Universities (Grant No.QYWKC2018007).
Author NameAffiliation
Yijun ZHONG School of Mathematical Sciences, Dalian University of Technology, Liaoning 116024, P. R. China 
Congjun LI School of Mathematical Sciences, Dalian University of Technology, Liaoning 116024, P. R. China 
Hits: 1226
Download times: 973
Abstract:
      In some applications, there are signals with piecewise structure to be recovered. In this paper, we propose a piecewise OMP (P\_OMP) method which aims to preserve the piecewise sparse structure (or the small-scaled entries) of piecewise signals. Besides the merits of OMP, the P\_OMP, which is a generalization of the combination of CoSaMP and OMMP (Orthogonal Multi-matching Pursuit) on piecewise sparse recovery, possesses the advantages of comparable approximation error decay as CoSaMP with more relaxed sufficient condition and better recovery success rate. Moreover, the P\_OMP algorithm recovers the piecewise sparse signal according to its piecewise structure, which results in better details preservation. Numerical experiments indicate that compared with CoSaMP, OMP, OMMP and BP methods, the P\_OMP algorithm is more effective and robust for piecewise sparse recovery.
Citation:
DOI:10.3770/j.issn:2095-2651.2018.06.010
View Full Text  View/Add Comment