Compressed Sensing Data Reconstruction Using Adaptive Generalized Orthogonal Matching Pursuit Algorithm

被引:0
作者
Sun, Hui [1 ]
Ni, Lin [1 ]
机构
[1] Univ Sci & Technol China, Dept Elect & Informat Sci, Hefei, Peoples R China
来源
2013 3RD INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT) | 2013年
基金
中国国家自然科学基金;
关键词
Signal processing; Compressed sensing; Sparse representation; Orthogonal matching pursuit; Image Reconstruction; SIGNAL RECOVERY;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Compressed sensing (CS), which breaks the limitations of the traditional Nyquist sampling theorem, takes full advantage of the sparse signal characteristics to achieve the accurate reconstruction of the compressed signal. An effective algorithm called GOAMP (Generalized Orthogonal Adaptive Matching Pursuit) algorithm was proposed by studying and summarizing the existing Matching Pursuit algorithm. The GOAMP algorithm can reconstruct the compressed signal exactly when the sparsity of the signal is unknown. Compare to the OMP (Orthogonal Matching Pursuit), the number of columns of the measurement matrix selected at each step is decided by the descent speed of the residual. Then like the OMP and the GOMP (Generalized Orthogonal Matching Pursuit), use the columns (atoms) selected before to reconstruct the original signal. The experiments show that the algorithm can choose the near-optimal iteration step quickly, signal reconstruction quality and efficiency of the algorithm are both ideal.
引用
收藏
页码:1102 / 1106
页数:5
相关论文
共 13 条
[1]   Gradient pursuits [J].
Blumensath, Thomas ;
Davies, Mike E. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (06) :2370-2382
[2]   Decoding by linear programming [J].
Candes, EJ ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (12) :4203-4215
[3]   Stable signal recovery from incomplete and inaccurate measurements [J].
Candes, Emmanuel J. ;
Romberg, Justin K. ;
Tao, Terence .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (08) :1207-1223
[4]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[5]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[6]   Stable recovery of sparse overcomplete representations in the presence of noise [J].
Donoho, DL ;
Elad, M ;
Temlyakov, VN .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (01) :6-18
[7]   Iterative thresholding algorithms [J].
Fornasier, Massimo ;
Rauhut, Holger .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2008, 25 (02) :187-208
[8]   MATCHING PURSUITS WITH TIME-FREQUENCY DICTIONARIES [J].
MALLAT, SG ;
ZHANG, ZF .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1993, 41 (12) :3397-3415
[9]   CoSaMP: Iterative signal recovery from incomplete and inaccurate samples [J].
Needell, D. ;
Tropp, J. A. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 26 (03) :301-321
[10]   Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit [J].
Needell, Deanna ;
Vershynin, Roman .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (03) :317-334