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

传感矩阵扰动下稀疏估计的性能界

On the Performance Bound of Sparse Estimation with Sensing Matrix Perturbation

Yujie Tang, Laming Chen, Yuantao Gu

摘要:

本文主要研究了在感知矩阵和观测向量均被加性高斯噪声污染的情况下的稀疏估计问题。对稀疏估计的性能界进行了深入的分析和讨论。讨论了两类下界:约束Cramér-Rao界(CCRB)和Hammersley-Chapman-Robbins界(HCRB).结果表明,与传感矩阵扰动的情况是更复杂的一个只有测量噪声。对于CCRB,推导出了其封闭形式的表达式。它证明了最大和非最大支持情况之间的差距。同时也揭示了CCRB与Oracle伪逆估计的均方误差之间存在差距,但当问题维数趋于无穷大时,CCRB渐近趋近于零。对于一个更严格的界,HCRB,尽管在获得一个简单的表达式,一般的传感矩阵的困难,在单位传感矩阵的情况下,一个封闭的形式的表达式推导的性能界的定性研究。结果表明,最大和非最大情况之间的差距被消除HCRB。数值模拟验证了本文的理论结果。

英文摘要:

This paper focusses on the sparse estimation in the situation where both the the sensing matrix and the measurement vector are corrupted by additive Gaussian noises. The performance bound of sparse estimation is analyzed and discussed in depth. Two types of lower bounds, the constrained Cramér-Rao bound (CCRB) and the Hammersley-Chapman-Robbins bound (HCRB), are discussed. It is shown that the situation with sensing matrix perturbation is more complex than the one with only measurement noise. For the CCRB, its closed-form expression is deduced. It demonstrates a gap between the maximal and nonmaximal support cases. It is also revealed that a gap lies between the CCRB and the MSE of the oracle pseudoinverse estimator, but it approaches zero asymptotically when the problem dimensions tend to infinity. For a tighter bound, the HCRB, despite of the difficulty in obtaining a simple expression for general sensing matrix, a closed-form expression in the unit sensing matrix case is derived for a qualitative study of the performance bound. It is shown that the gap between the maximal and nonmaximal cases is eliminated for the HCRB. Numerical simulations are performed to verify the theoretical results in this paper.

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

↑