检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《北京邮电大学学报》2013年第1期19-22,共4页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(61001119);国家科技重大专项项目(2012ZX03005008-001)
摘 要:针对压缩感知理论中现有重构算法耗时过长的问题,提出一种基于优化内积模型的快速重构算法,且理论推导了迭代停止条件.该算法在重构的每次迭代过程中,仅在第1次迭代时采用传感矩阵与余量的矩阵求内积运算,在后续的迭代中则通过向量运算代替矩阵求内积的运算,迭代停止时只需进行一次最小二乘法即可获得重构信号.仿真结果表明,提出的快速重构算法在保证重构信号性能的基础上,大大减少了重构时间.The existing reconstruction algorithms in compressed sensing (CS) theory commonly cost too much time. A novel reconstruction algorithm based on inner product optimization is proposed to reduce reconstruction time. And also stopping criterion is derived from theory. The proposed algorithm computes the inner product of measurement matrix and the residual only in the first iteration during the reconstruc- tion process. In the remaining iterations, the inner product of vectors instead of matrices is calculated. Then least square calculation is done only once to reconstruct the signal after iterations stopped. Experi- ments show that the proposed algorithm reduces the reconstruction time largely without degrading the quality of the signal.
分 类 号:TN911.72[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3