arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.04914eess.SP
收藏

利用正交最小二乘型算法恢复稀疏信号的条件

Recovery Conditions of Sparse Signals Using Orthogonal Least Squares-Type Algorithms

L. Lu, W. Xu, Y. Wang, Z. Tian

摘要:

正交最小二乘(OLS)类算法是重构稀疏信号的有效算法,包括著名的OLS、多重OLS(MOLS)和块OLS(BOLS)。在本文中,我们首先研究这些算法的无噪声精确恢复条件。具体地说,基于互不相干性(MIP),我们提供了理论分析的OLS和MOLS,以确保正确的非零支持可以选择在迭代过程中。然而,BOLS的理论分析使用块MIP来处理块稀疏性。此外,无噪声MIP为基础的分析扩展到有噪声的情况下。结果表明,对于K稀疏信号,当MIP或SNR满足一定条件时,OLS和MOLS最多只需K次迭代就能获得可靠的重建结果,而BOLS最多只需(K/d)次迭代就能获得可靠的重建结果,其中d为块长.结果表明,我们推导出的理论结果改进了现有的,这是由模拟试验验证。

英文摘要:

Orthogonal least squares (OLS)-type algorithms are efficient in reconstructing sparse signals, which include the well-known OLS, multiple OLS (MOLS) and block OLS (BOLS). In this paper, we first investigate the noiseless exact recovery conditions of these algorithms. Specifically, based on mutual incoherence property (MIP), we provide theoretical analysis of OLS and MOLS to ensure that the correct nonzero support can be selected during the iterative procedure. Nevertheless, theoretical analysis for BOLS utilizes the block-MIP to deal with the block sparsity. Furthermore, the noiseless MIP-based analyses are extended to the noisy scenario. Our results indicate that for K-sparse signals, when MIP or SNR satisfies certain conditions, OLS and MOLS obtain reliable reconstruction in at most K iterations, while BOLS succeeds in at most (K/d) iterations where d is the block length. It is shown that our derived theoretical results improve the existing ones, which are verified by simulation tests.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑