首页> 外文期刊>Journal of Applied Computer Science Methods >Least Support Orthogonal Matching Pursuit Algorithm With Prior Information
【24h】

Least Support Orthogonal Matching Pursuit Algorithm With Prior Information

机译:具有先验信息的最小支持正交匹配追踪算法

获取原文
           

摘要

This paper proposes a new fast matching pursuit technique named Partially Known Least Support Orthogonal Matching Pursuit (PKLS-OMP) which utilizes partially known support as a prior knowledge to reconstruct sparse signals from a limited number of its linear projections. The PKLS-OMP algorithm chooses optimum least part of the support at each iteration without need to test each candidate independently and incorporates prior signal information in the recovery process. We also derive sufficient condition for stable sparse signal recovery with the partially known support. Result shows that inclusion of prior information weakens the condition on the sensing matrices and needs fewer samples for successful reconstruction. Numerical experiments demonstrate that PKLS-OMP performs well compared to existing algorithms both in terms of reconstruction performance and execution time.
机译:本文提出了一种新的快速匹配追踪技术,即部分已知的最小支持正交匹配追踪(PKLS-OMP),该技术利用部分已知的支持作为先验知识,从有限数量的线性投影中重建稀疏信号。 PKLS-OMP算法在每次迭代中选择最优的支持部分,而无需独立测试每个候选对象,并且在恢复过程中合并了先验信号信息。我们还导出了部分已知支持下稳定稀疏信号恢复的充分条件。结果表明,包含先验信息会削弱传感矩阵的条件,并且需要较少的样本才能成功进行重建。数值实验表明,与现有算法相比,PKLS-OMP在重建性能和执行时间上均表现出色。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号