基于OMP/OLS的信号和噪声统计无关稀疏重建
Signal and Noise Statistics Oblivious Sparse Reconstruction using OMP/OLS
摘要:
正交匹配追踪(OMP)和正交最小二乘(OLS)被广泛用于欠定线性回归问题中稀疏信号重构。这些压缩感知(CS)算法的性能关键地取决于信号的稀疏性($k_0$)或噪声方差($σ^2$)的\textit{a priori}知识。$k_0$和$σ^2$通常都是未知的,并且在欠确定的模型中极难估计。这限制了OMP和OLS在许多实际情况中的应用。在这篇文章中,我们开发了两个计算效率高的框架,即TF-IGP和RRT-IGP,即使在$k_0$和$σ^2$不可用时,也可以使用OMP和OLS。TF-IGP和RRT-IGP的分析表明,完成成功的稀疏恢复在同一组的限制等距条件下的设计矩阵所需的OMP/OLS与\textit{a priori}知识的$k_0$和$σ^2$。数值模拟还表明,与具有$k_0$和$σ^2$的\textit{a priori}知识的OMP/OLS相比,TF-IGP和RRT-IGP具有高度竞争力的性能。
英文摘要:
Orthogonal matching pursuit (OMP) and orthogonal least squares (OLS) are widely used for sparse signal reconstruction in under-determined linear regression problems. The performance of these compressed sensing (CS) algorithms depends crucially on the \textit{a priori} knowledge of either the sparsity of the signal ($k_0$) or noise variance ($σ^2$). Both $k_0$ and $σ^2$ are unknown in general and extremely difficult to estimate in under determined models. This limits the application of OMP and OLS in many practical situations. In this article, we develop two computationally efficient frameworks namely TF-IGP and RRT-IGP for using OMP and OLS even when $k_0$ and $σ^2$ are unavailable. Both TF-IGP and RRT-IGP are analytically shown to accomplish successful sparse recovery under the same set of restricted isometry conditions on the design matrix required for OMP/OLS with \textit{a priori} knowledge of $k_0$ and $σ^2$. Numerical simulations also indicate a highly competitive performance of TF-IGP and RRT-IGP in comparison to OMP/OLS with \textit{a priori} knowledge of $k_0$ and $σ^2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。