Batch Algorithms of Matching Pursuit and Orthogonal Matching Pursuit with Applications to Compressed Sensing

摘要：

Batch algorithms of matching pursuit (MP) and orthogonal matching pursuit (OMP) are proposed in this paper. In both algorithms, the original iteration procedures are modified in the following way. Instead of finding a single best-matched atom in each iteration, we find a number of best-matched atoms to speed up the convergence, - a batch version. Then optimized coefficients are computed based on these atoms. Numerical simulations in the application to compressed sensing show that the proposed algorithms are much faster than the original ones, while similar reconstruction precision is obtained.

作者: Huiyuan Wang José Vieira Paulo Ferreira Bruno Jesus Isabel Duarte

作者单位: IEETA,Universidade de Aveiro,3810-193 Aveiro,Portugal,on leave from the School of Information Scienc José Vieira,Paulo Ferreira,Bruno Jesus and Isabel Duarte are with the IEETA,Universidade de Aveiro,3

会议类型: 国际会议

会议名称: 2009 IEEE International Conference on Information and Automation(2009年 IEEE信息与自动化国际学术会议)

会议地点: 珠海、澳门

会议语种:英文

页码: 824-829

在线出版日期: 2009-06-22（万方平台首次上网日期，不代表论文的发表时间）