arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.03975cs.LGeess.SPstat.AP
收藏

高斯噪声和饱和噪声下稀疏信号的重构

Reconstruction of Sparse Signals under Gaussian Noise and Saturation

Shuvayan Banerjee, Radhe Srivastava, Ajit Rajwade

摘要:

大多数压缩感知算法不考虑噪声压缩测量中的饱和效应,尽管饱和是现有传感器的有限动态范围的重要后果。处理饱和效应的少数算法要么简单地丢弃饱和测量,要么施加额外的约束以确保估计信号与给定均匀有界噪声的饱和测量(基于已知的饱和阈值)的一致性。在本文中,我们反而提出了一个新的数据保真度函数,这是直接基于确保一定形式的信号和饱和测量之间的一致性,并可以表示为负对数的某个精心设计的似然函数。我们的估计工作,即使在高斯噪声的情况下(这是无界的)的测量。我们证明了我们的数据保真度函数是凸的。此外,我们证明了它满足条件的限制强凸性,从而推导出一个上界的估计性能。我们还表明,我们的技术实验产生的结果优于最先进的各种实验设置下,从噪声和饱和测量的压缩信号恢复。

英文摘要:

Most compressed sensing algorithms do not account for the effect of saturation in noisy compressed measurements, though saturation is an important consequence of the limited dynamic range of existing sensors. The few algorithms that handle saturation effects either simply discard saturated measurements, or impose additional constraints to ensure consistency of the estimated signal with the saturated measurements (based on a known saturation threshold) given uniform-bounded noise. In this paper, we instead propose a new data fidelity function which is directly based on ensuring a certain form of consistency between the signal and the saturated measurements, and can be expressed as the negative logarithm of a certain carefully designed likelihood function. Our estimator works even in the case of Gaussian noise (which is unbounded) in the measurements. We prove that our data fidelity function is convex. We moreover, show that it satisfies the condition of Restricted Strong Convexity and thereby derive an upper bound on the performance of the estimator. We also show that our technique experimentally yields results superior to the state of the art under a wide variety of experimental settings, for compressive signal recovery from noisy and saturated measurements.

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

↑