• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Theory, IEEE Transactions on >Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
【24h】

Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property

机译：基于受限等距特性的正交匹配追踪分析

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used for a very straightforward analysis of OMP. Our main conclusion is that the RIP of order $K+1$ (with isometry constant $delta < {{ 1}over { 3sqrt {K}}}$) is sufficient for OMP to exactly recover any $K$-sparse signal. The analysis relies on simple and intuitive observations about OMP and matrices which satisfy the RIP. For restricted classes of $K$-sparse signals (those that are highly compressible), a relaxed bound on the isometry constant is also established. A deeper understanding of OMP may benefit the analysis of greedy algorithms in general. To demonstrate this, we also briefly revisit the analysis of the regularized OMP (ROMP) algorithm.
机译：正交匹配追踪（OMP）是用于稀疏近似的规范贪婪算法。在本文中，我们证明了受限等距特性（RIP）可用于OMP的非常简单的分析。我们的主要结论是，阶跃为$ K + 1 $的RIP（等距常数$ delta <{{1}在{3sqrt {K}}} $上）足以使OMP准确恢复任何$ K $稀疏信号。该分析基于对OMP和满足RIP的矩阵的简单直观的观察。对于$ K $稀疏信号的受限类（高度可压缩的信号），还建立了等轴测常数的松弛范围。通常，对OMP的更深入的了解可能会对贪婪算法的分析有所帮助。为了证明这一点，我们还简要回顾了对正则化OMP（ROMP）算法的分析。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号