arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.2079cs.ITcond-mat.stat-mechmath.ITmath.STstat.TH
收藏

近似稀疏信号的压缩感知:相位变化与最优重构

Compressed Sensing of Approximately-Sparse Signals: Phase Transitions and Optimal Reconstruction

Jean Barbier, Florent Krzakala, Marc Mézard, Lenka Zdeborová

摘要:

压缩感知被设计为以压缩形式直接测量稀疏信号。然而,大多数感兴趣的信号仅是“近似稀疏的”,即,即使信号仅包含相关(大)分量的一小部分,其他分量也不严格等于零,而是仅接近零。本文将近似稀疏信号建模为小分量高斯分布,研究了其压缩感知问题。我们使用副本计算,以确定贝叶斯最佳重建的均方误差,这样的信号,作为小组件的方差,大组件的密度和测量速率的函数。然后,我们使用的G-AMP算法,我们量化的区域参数,该算法实现最优(大型系统)。最后,我们表明,在该地区的GAMP均匀的测量矩阵不是最佳的,一个特殊的“播种”设计的空间耦合测量矩阵允许恢复最优。

英文摘要:

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large) components the other components are not strictly equal to zero, but are only close to zero. In this paper we model the approximately sparse signal with a Gaussian distribution of small components, and we study its compressed sensing with dense random matrices. We use replica calculations to determine the mean-squared error of the Bayes-optimal reconstruction for such signals, as a function of the variance of the small components, the density of large components and the measurement rate. We then use the G-AMP algorithm and we quantify the region of parameters for which this algorithm achieves optimality (for large systems). Finally, we show that in the region where the GAMP for the homogeneous measurement matrices is not optimal, a special "seeding" design of a spatially-coupled measurement matrix allows to restore optimality.

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

↑