期刊文献+

基于OMP算法的快速压缩感知图像重构 被引量:7

Fast compressed sensing image reconstruction based on OMP algorithm
原文传递
导出
摘要 针对正交匹配追踪(OMP)算法在压缩感知理论下的重构效果和所需时间相互矛盾的问题,基于子空间追踪(SP)算法的回溯思想,使用共轭梯度下降算法代替最小二乘法对正交匹配追踪(OMP)算法进行改进.并且对所改进算法的重构精度、重构稳定性进行了仿真实验,结果表明所提算法能保证重构质量良好并且有更好的重构速度和稳定性. This paper proposed an improved OMP (Orthogonal Matching Pursuit)algorithm that replaced Ordinary Least Square algorithm with Conjugate Gradient Descent algorithm based on the backfitting idea of Subspace Pursuit algorithm, in order to solve the problem of contradiction between reconstruction effort and time required of OMP algorithm under compressive sensing theory.This paper also made simulation experiment on the accuracy and stability of reconstruction of the improved algorithm.The result showed that the improved algorithm made the quality of reconstruction satisfying with better speed and stability of reconstruction.
作者 马博珩 彭艺
出处 《云南大学学报(自然科学版)》 CAS CSCD 北大核心 2017年第2期207-211,共5页 Journal of Yunnan University(Natural Sciences Edition)
基金 云南省科技厅面上项目(KKS0201403016)
关键词 压缩感知 OMP算法 信号重构 图像重构 compressed sensing (CS) Orthogonal Matching Pursuit algorithm (OMP) signal reconstruction image reconstruction
  • 相关文献

参考文献2

二级参考文献26

  • 1E Candes, J Romberg. Quantitative robust uncertainty principles and optimally sparse decompositions[ J]. Foundations of Com- putational Mathematics, 2006,6(2) : 227 - 254.
  • 2E Candes, J Romberg, T Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information[ J]. IEEE Transaction on Information Theory, 2006, 52(2) :489 - 509.
  • 3E Candes, T Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? [J]. IEEE Transaction on Information Theory,2006,52(12) :5406- 5425.
  • 4D L Donoho. Compressed sensing[ J]. IEEE Transaction on Information Theory,2006,52(4) : 1289 - 1306.
  • 5D L Donoho, Tsaig Y. Extensions of compressed sensing[ J]. Signal Processing, 2006,86(3) : 533 - 548.
  • 6Mallat S,Z Zhang. Matching pursuit in a time-frequency dictionary[J].IEEE Transaction on Signal Processing, 1993,41 (12) :3397 - 3415.
  • 7K Schnass, P Vandergheynst. Dictionary preconditioning for greedy algorithms [ J ]. IEEE Transaction on Signal Process, 2008,56(5) : 1994 - 2002.
  • 8S S Chen, D L Donoho, M A Saunders, etc. Atomic decomposition by basis pursuit[ J] . SIAM Journal of Scientific Computing, 1998,20(1 ) :33 - 61.
  • 9D L Donoho. For most large underdetermined systerns of linear equations the minimal Ll-norm solution is also the sparsest solution[J]. Communications on Pure and Applied Mathematics,2006,59(6) :797 - 829.
  • 10J J Fuchs. Recovery of exact sparse representations in the presence of bounded noise[ J ]. IEEE Transaction on Information Theory, 2005,51 (10) : 3601 - 3608.

共引文献127

同被引文献65

引证文献7

二级引证文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部