首页> 外文期刊>IEEE signal processing letters >Improving the Correlation Lower Bound for Simultaneous Orthogonal Matching Pursuit
【24h】

Improving the Correlation Lower Bound for Simultaneous Orthogonal Matching Pursuit

机译:改善同时正交匹配追踪的相关下界

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The simultaneous orthogonal matching pursuit (SOMP) algorithm aims to find the joint support of a set of sparse signals acquired under a multiple measurement vector model. Critically, the analysis of SOMP depends on the maximal inner product of any atom of a suitable dictionary and the current signal residual, which is formed by the subtraction of previously selected atoms. This inner product, or correlation, is a key metric to determine the best atom to pick at each iteration. This letter provides, for each iteration of SOMP, a novel lower bound of the aforementioned metric for the atoms belonging to the correct and common joint support of the multiple signals. Although the bound is obtained for the noiseless case, its main purpose is to intervene in noisy analyses of SOMP. Finally, it is shown for specific signal patterns that the proposed bound outperforms state-of-the-art results for SOMP and orthogonal matching pursuit (OMP) as a special case.
机译:同时正交匹配追踪(SOMP)算法旨在找到在多个测量向量模型下获取的一组稀疏信号的联合支持。至关重要的是,对SOMP的分析取决于合适字典中任何原子的最大内积和电流信号残差,后者是通过减去先前选择的原子而形成的。此内积或相关性是确定每次迭代中选择的最佳原子的关键指标。对于SOMP的每次迭代,该字母为属于多个信号的正确且共同的联合支持的原子提供了上述度量的新颖下限。尽管为无噪声情况获得了界限,但其主要目的是干预SOMP的噪声分析。最后,对于特殊的信号模式,表明所提出的边界优于SOMP和正交匹配追踪(OMP)的最新结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号