首页 | 本学科首页   官方微博 | 高级检索  
     

压缩感知中基于变尺度法的贪婪重构算法的研究
引用本文:刘盼盼,李 雷,王浩宇.压缩感知中基于变尺度法的贪婪重构算法的研究[J].通信学报,2014,35(12):12-105.
作者姓名:刘盼盼  李 雷  王浩宇
作者单位:南京邮电大学 非结构化数据计算理论与应用研究中心,江苏 南京 210046
基金项目:国家自然科学基金资助项目(61070234,61071167)
摘    要:首先将最优化方法中的梯度法与贪婪算法相结合,在已有梯度追踪算法的基础上提出了基于变尺度法的梯度追踪(VMMGP)算法,分析比较这些算法的计算复杂度和存储需求;其次用这些算法分别重构一维、二维信号,分析比较了算法重构效果及其性能好坏。实验结果表明,对于一维信号和二维信号的重构,所提出的VMMGP算法,重构效果是所有梯度追踪算法中最好的。

关 键 词:正交匹配追踪  梯度方向  梯度追踪  变尺度法  计算复杂度  存储需求

Research on greedy reconstruction algorithms of compressed sensing based on variable metric method
Pan-pan LIU,Lei LI,Hao-yu WNAG.Research on greedy reconstruction algorithms of compressed sensing based on variable metric method[J].Journal on Communications,2014,35(12):12-105.
Authors:Pan-pan LIU  Lei LI  Hao-yu WNAG
Affiliation:Unstructured Data Calculation Theory and Application Research Center,Nanjing University of Posts and Telecommunications,Nanjing 210046,China
Abstract:A variable metric method based gradient pursuit algorithm based on some existing gradient pursuit algorithms was proposed by combining the gradient direction of optimization methods with greedy algorithms. The computational complexity and storage requirements of these algorithms were also analysed and compared. In experimental part, all these algorithms were used to reconstruct one-dimensional audio signal and two-dimensional image signal. Experimental results show that the VMMGP algorithm has the best reconstruction performance among all the gradient pursuit algorithms.
Keywords:orthogonal matching pursuit  gradient direction  gradient pursuit  variable metric method  computational complexity  storage requirements
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号