首页> 外文期刊>Tecnologias del Aprendizaje, IEEE Revista Iberoamericana de >Maximal-minimal correlation atoms algorithm for sparse recovery
【24h】

Maximal-minimal correlation atoms algorithm for sparse recovery

机译:稀疏恢复的最大最小相关原子算法

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

摘要

A new iterative algorithm is proposed to reconstruct an unknown sparse signal from a set of projected measurements. Unlike existing greedy pursuit methods which only consider the atoms having the highest correlation with the residual signal, the proposed algorithm not only considers the higher correlation atoms but also reserves the lower correlation atoms with the residual signal. In the lower correlation atoms, only a few are correct which usually impact the reconstructive performance and decide the reconstruction dynamic range of greedy pursuit methods. The others are redundant. In order to avoid redundant atoms impacting the reconstructive accuracy, the Bayesian pursuit algorithm is used to eliminate them. Simulation results show that the proposed algorithm can improve the reconstructive dynamic range and the reconstructive accuracy. Furthermore, better noise immunity compared with the existing greedy pursuit methods can be obtained.
机译:提出了一种新的迭代算法,用于从一组投影测量中重建未知的稀疏信号。与现有的只考虑与残差信号具有最高相关性的原子的贪婪追踪方法不同,该算法不仅考虑了较高相关性的原子,而且还保留了具有残差信号的较低相关性的原子。在较低相关性的原子中,只有少数是正确的,这通常会影响重建性能并决定贪婪追踪方法的重建动态范围。其他都是多余的。为了避免多余原子影响重构精度,使用贝叶斯追踪算法将其消除。仿真结果表明,该算法可以提高重建动态范围和重建精度。此外,与现有的贪婪追踪方法相比,可以获得更好的抗噪性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号