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

一比特压缩传感的贪婪重构算法
引用本文:肖涛,马社祥.一比特压缩传感的贪婪重构算法[J].科学技术与工程,2012,12(34):9182-9185.
作者姓名:肖涛  马社祥
作者单位:天津理工大学计算机与通信工程学院,天津,300384
基金项目:国家自然科学基金项目(面上项目,重点项目,重大项目)
摘    要:针对测量值的一比特量化,提出了一种新型贪婪迭代算法:符号子空间追踪算法。该算法融合了一致性恢复和贪婪迭代的原理,将量化误差对重构的影响降到最小。仿真结果表明,在高比特率的情况下,该算法的重构误差比只考虑稀疏性和只考虑一致性恢复的算法分别低13 dB和21 dB。

关 键 词:压缩传感  量化  一比特  贪婪算法
收稿时间:2012/7/31 0:00:00
修稿时间:8/17/2012 8:29:25 PM

Greedy Reconstruction Algorithm of One-bit Compressed Sensing
xiaotao and.Greedy Reconstruction Algorithm of One-bit Compressed Sensing[J].Science Technology and Engineering,2012,12(34):9182-9185.
Authors:xiaotao and
Institution:(School of Computer and Communication Engineering,TianJin University of Technology,TianJin 300384,P.R.China)
Abstract:A novel greedy iterative algorithm is proposed for the measurements quantized to one bit: sign subspace pursuit algorithm. This algorithm combines the principle of consistent reconstruction and greedy iteration, and minimizes the influence of the quantization error on the reconstruction. In the case of high bit rate, simulated result shows that the reconstruction error of the algorithm is about 13dB and 21dB lower than traditional recovery algorithms that use only sparsity or only consistency.
Keywords:compressed sensing(CS)  quantization  one bit  greedy algorithm
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《科学技术与工程》浏览原始摘要信息
点击此处可从《科学技术与工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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