• •    

利用观测矩阵优化的自适应压缩感知

胡强1,林云2   

  1. 1. 重庆邮电大学通信与信息工程学院
    2. 重庆邮电大学
  • 收稿日期:2017-06-12 修回日期:2017-07-31 发布日期:2017-07-31
  • 通讯作者: 胡强

Adaptive compressed sensing utilizing observation matrix optimization

  • Received:2017-06-12 Revised:2017-07-31 Online:2017-07-31

摘要: 为提高传统压缩感知(Compressed Sensing,CS)恢复算法的抗噪性能,该文结合观测矩阵优化和自适应观测的思想,提出一类自适应压缩感知算法。该算法将观测能量全部分配在由传统CS恢复算法估计的支撑位置,由于估计支撑集中包含支撑位置,这样可有效提高观测信噪比;再从优化观测矩阵的角度推导出最优的新观测向量,即其非零部分设计为Gram矩阵的特征向量。仿真结果表明,随着观测数增大Gram矩阵非对角元素的能量增速小于传统CS算法,并且分别在观测次数、稀疏度和信噪比相同的条件下,所提算法的重构误差均低于传统CS恢复算法和典型的贝叶斯自适应算法。分析表明,所提自适应观测机制可有效改善传统CS恢复算法的抗噪性能。

关键词: 自适应压缩感知, 观测矩阵优化, 观测信噪比, 特征分解, Gram矩阵

Abstract: Abstract: In order to improve the robustness of compressed sensing (CS) recovery algorithm, a kind of adaptive compressed sensing (ACS) algorithm is proposed based on the idea of observation matrix optimization and adaptive observation. The algorithm allocates the energy all in the support position estimated by the traditional CS recovery algorithm, which can effectively improve the observed signal-to-noise ratio (SNR), and then derive the optimal new observation vector from the perspective of observation matrix optimization, that is its nonzero part is designed as the eigenvector of Gram matrix. The simulation results show that the energy growth of the non-diagonal elements of the Gram matrix is slower than that of the traditional CS algorithm with the increase of the number of observations, and the reconstruction errors of the proposed algorithm is respectively lower than the traditional CS recovery algorithm and typical Bayesian adaptive algorithm under the same conditions of the number of observations, sparsity and SNR. The analysis shows that the proposed adaptive observation mechanism can effectively improve the anti-noise performance of the traditional CS recovery algorithm.

Key words: Keywords: adaptive compressed sensing, observation matrix optimization, observed signal-to-noise ratio, feature decomposition, Gram matrix

中图分类号: