首页> 外文期刊>International Journal of Computational Intelligence and Applications >An Iterative Hard Thresholding Algorithm based on Sparse Randomized Kaczmarz Method for Compressed Sensing
【24h】

An Iterative Hard Thresholding Algorithm based on Sparse Randomized Kaczmarz Method for Compressed Sensing

机译:一种基于稀疏随机kaczmarz方法的迭代硬阈值算法,用于压缩检测

获取原文
获取原文并翻译 | 示例
           

摘要

The paper proposes a novel signal reconstruction algorithm through substituting the gradient descent method in the iterative hard thresholding algorithm with a faster sparse randomized Kaczmarz method. By designing a series of gradually attenuated weights for the matrix rows whose indexes lie outside of the support set of the original sparse signal, we can focus the iterations on the effective support rows of the measurement matrix. The experiment results show that the proposed algorithm presents a faster convergence rate and more accurate reconstruction accuracy than the state-of-the-art algorithms. Meanwhile, the successful reconstruction probability of the proposed algorithm is higher than that of other algorithms. Moreover, the characteristics of the proposed signal reconstruction algorithm are also analyzed in detail through numerical experiments.
机译:本文通过用更快的稀疏随机kaczmarz方法代替迭代硬阈值算法中的梯度下降方法来提出一种新的信号重建算法。 通过设计一系列逐渐减弱的矩阵行的权重,其索引位于原始稀疏信号的支持集之外,我们可以将迭代集中在测量矩阵的有效支持行上。 实验结果表明,该算法提出了比最先进的算法更快的收敛速度和更准确的重建精度。 同时,所提出的算法的成功重建概率高于其他算法的重建概率。 此外,还通过数值实验详细分析了所提出的信号重建算法的特性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号