arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.3886cs.ITmath.IT
收藏

线性高斯模型下稀疏向量的最小方差估计:一种RKHS方法

Minimum Variance Estimation of a Sparse Vector within the Linear Gaussian Model: An RKHS Approach

Alexander Jung, Sebastian Schmutzhard, Franz Hlawatsch, Zvika Ben-Haim, Yonina C. Eldar

摘要:

我们考虑稀疏线性高斯模型(SLGM)中的最小方差估计。稀疏向量是从嵌入高斯噪声中的线性变换版本中估计的。我们的分析是基于再生核希尔伯特空间(RKHS)的理论。与SLGM的RKHS的表征后,我们推导出新的最小方差估计与规定的偏置函数的下界。这包括无偏估计的重要情况。方差界是通过一个正交投影到与SLGM相关的RKHS的子空间上的规定的平均函数。此外,我们专门压缩感知测量矩阵的界限,并表示他们的限制等距和相干参数。对于由稀疏信号噪声模型(SSNM)给出的SLGM的特殊情况,我们推导出最小可达方差(Barankin界)和相应的局部最小方差估计的封闭形式的表达式。我们还分析了精确和近似稀疏性信息的影响,并表明精确稀疏性的最小可实现方差不是近似稀疏性的极限情况。最后,我们比较我们的界限与三个著名的估计,即最大似然估计,硬阈值估计,压缩重建使用正交匹配追求的方差。

英文摘要:

We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterization of the RKHS associated with the SLGM, we derive novel lower bounds on the minimum variance achievable by estimators with a prescribed bias function. This includes the important case of unbiased estimation. The variance bounds are obtained via an orthogonal projection of the prescribed mean function onto a subspace of the RKHS associated with the SLGM. Furthermore, we specialize our bounds to compressed sensing measurement matrices and express them in terms of the restricted isometry and coherence parameters. For the special case of the SLGM given by the sparse signal in noise model (SSNM), we derive closed-form expressions of the minimum achievable variance (Barankin bound) and the corresponding locally minimum variance estimator. We also analyze the effects of exact and approximate sparsity information and show that the minimum achievable variance for exact sparsity is not a limiting case of that for approximate sparsity. Finally, we compare our bounds with the variance of three well-known estimators, namely, the maximum-likelihood estimator, the hard-thresholding estimator, and compressive reconstruction using the orthogonal matching pursuit.

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

↑