一种基于最小二乘优化的快速压缩感知算法.pdfVIP

CN 43- 1258/ TP 第 38 卷第 8 期 2016 年 8 月 计算机工程与科学 ISSN 1007- 130X Computer Engineering . Science Vol. 38 . No. 8 ,Aug. 2016 文章编号: 1007- 130X(201 的08-1709-06 一种基于最小二乘优化的快速压缩感知算法. 张永平l ，张功董2 (1.盐城工学院信息工程学院，江苏 盐城 224051 ; 2. 商京理工大学计算机工程学院，江苏南京 210094) 摘 要:压缩感知方法可以以远低于传统采样定理规定的采样牟对仿号采样. 针对压缩感知重构信 号的时间较长且随信号增大以极高速率快速增长的问题，提出了面向国像馆号的快速压缩感知算法 FB­ WRFI . FBWRFI 基于最小二乘方法实现信号的优化重构，利用新定义的整体相关性皮量参数选择针对 图像信号的最相关原子，引入分决重构理论并重新设计分块大小和测量矩碎，有效降低了重构操作的计算 复杂度和计算规模.实验结果表明，FBWRFI 算法可以显著降低估号的重构时间，并使随信号增大而高 速场长的重构时间的地长趋势变为线性，证明了算法的有效性. 关键词:压缩感知;快速重构;最小二乘优化;整体相关参数;分决重构 中图分类号: T P 39 1. 9 文献标志码: A doi: 10. 3969/ j. issn. 1007- 130X. 2016. 08 . 029 A fast compressed sensing algorithm based on optimized least-square method ZHANG Yong-ping 1 ,ZHANG Gong- xuan2 (1. Sch∞1 of Informat ion Engineering ,Yancheng Institute of Technology ,Yancheng 224051; 2. School of Computer Science and Engineering. Nanjing University of Science and Technology. Nanjing 210094. China) Abstract: The n ew sampling method of compressed sensing (CS) can sample s igna ls at a very low rate that is w e ll below the predetermined sampling rate set by the Shannon-Nyquist sampling theorem. But the recon struction time of CS algorithms is longer and it grows rapidly with th e size of signals. To overcome the abovem entioned problems. we propose an algorithm , called fa st block whole r econstruc - tion for image (FBWRFl), which can quickly reconstruct image signals. The FBWRFI reconstructs sig- n a ls based on the least squ a res method