arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.03114eess.SPcs.CVeess.IV
收藏

从离散傅里叶变换的量化噪声样本重构信号

Signal Reconstruction from Quantized Noisy Samples of the Discrete Fourier Transform

Indian Institute of Technology Bombay(印度理工学院孟买分校);Stanford University(斯坦福大学)

Mohak Goyal, Animesh Kumar

摘要:

在本文中,我们提出了两种变化的算法,用于从离散傅里叶变换(DFT)的一位或两位噪声观测信号重构。DFT的一位观测值对应于其实部的符号,而DFT的两位观测值对应于DFT的实部和虚部的符号。我们专注于图像的分析和模拟,从而使用的2D-DFT的符号。这类信号的选择是受以前的作品在这个问题上。对于我们的算法,我们表明,在信号重建的预期均方误差(MSE)是渐近成正比的采样率的倒数。样本受已知分布的加性零均值噪声的影响。我们解决这个信号估计问题,设计一个算法,使用压缩映射,基于Banach不动点定理。四个基准图像的数值测试表明,我们的算法的有效性。采用用于图像重建质量评估的各种度量,诸如PSNR、SSIM、ESSIM和MS-SSIM。在所有四个基准图像上,我们的算法在所有这些指标上的表现都大幅优于最先进的算法。

英文摘要:

In this paper, we present two variations of an algorithm for signal reconstruction from one-bit or two-bit noisy observations of the discrete Fourier transform (DFT). The one-bit observations of the DFT correspond to the sign of its real part, whereas, the two-bit observations of the DFT correspond to the signs of both the real and imaginary parts of the DFT. We focus on images for analysis and simulations, thus using the sign of the 2D-DFT. This choice of the class of signals is inspired by previous works on this problem. For our algorithm, we show that the expected mean squared error (MSE) in signal reconstruction is asymptotically proportional to the inverse of the sampling rate. The samples are affected by additive zero-mean noise of known distribution. We solve this signal estimation problem by designing an algorithm that uses contraction mapping, based on the Banach fixed point theorem. Numerical tests with four benchmark images are provided to show the effectiveness of our algorithm. Various metrics for image reconstruction quality assessment such as PSNR, SSIM, ESSIM, and MS-SSIM are employed. On all four benchmark images, our algorithm outperforms the state-of-the-art in all of these metrics by a significant margin.

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

↑