首页 | 官方网站   微博 | 高级检索  
     

一种稀疏度自适应正交多匹配追踪重构算法
引用本文:林云,王凯.一种稀疏度自适应正交多匹配追踪重构算法[J].科学技术与工程,2014,14(2).
作者姓名:林云  王凯
作者单位:重庆邮电大学移动通信技术重庆市重点实验室,重庆邮电大学移动通信技术重庆市重点实验室
摘    要:压缩感知理论是一种利用信号稀疏性或可压缩性对信号进行采样同时压缩的新颖的信号采样理论。针对稀疏度未知信号重构问题,提出了一种稀疏度自适应正交多匹配追踪重构算法。该算法在广义正交匹配算法(generalized orthogonal multi matching pursuit,GOMP)基础上结合稀疏自适应思想。根据相邻阶段信号能量差自适应调整当前步长大小选取支撑集的原子个数,先大步接近,后小步逼近信号真实稀疏度,从而实现对信号精确重构。实验仿真结果表明,该算法能有效精确重构信号。具有良好的重构性能和较高的重构效率。

关 键 词:压缩感知  稀疏性  匹配追踪  重构算法  正交匹配  自适应
收稿时间:2013/8/19 0:00:00
修稿时间:2013/8/19 0:00:00

A Sparsity Adaptive Orthogonal Multi Matching PursuitAlgorithm
Abstract:Compressive sensing is a novel signal sampling theory under the condition that signal is sparse or compressible. In this case , the small amount of signal values can be reconstructed accurately when the signal is sparse or compressible. In this paper, a sparsity adaptive orthogonal multi matching pursuit algorithm is proposed for reconstruction without prior information of the sparsity. It realized the close approach of signal sparse step by step based on the frame of Generalized Orthogonal Multi Matching Pursuit(GOMP). In the beginning, use high value of step size to approach the true sparsity of the signal rapidly, then switch to small value of step size to achieve the precise approach of signal. Finally, it realized the precise reconstruction of sparse signal. At last, the experimental results show that the proposed algorithm can get better reconstruction performances and speed than other algorithms.
Keywords:Compressive sampling    sparsity    greedy pursuit    reconstruction algorithm orthogonal matching  adaptive
本文献已被 CNKI 等数据库收录!
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号