Decomposition of digital signals and images into other basis or dictionaries than time or space domains is a very common approach in signal and image processing and analysis. Such a decomposition is commonly obtained using fixed transforms (e.g., Fourier or wavelet) or dictionaries learned from example databases or from the signal or image itself. In this work, we investigate in detail a new approach of constructing such a signal or image-dependent bases inspired by quantum mechanics tools, i.e., by considering the signal or image as a potential in the discretized Schroedinger equation. To illustrate the potential of the proposed decomposition, denoising results are reported in the case of Gaussian, Poisson, and speckle noise and compared to the state of the art algorithms based on wavelet shrinkage, total variation regularization or patch-wise sparse coding in learned dictionaries, non-local means image denoising, and graph signal processing.
A new Plug-and-Play (PnP) alternating direction of multipliers (ADMM) scheme is proposed in this paper, by embedding a recently introduced adaptive denoiser using the Schroedinger equation’s solutions of quantum physics. The potential of the proposed model is studied for Poisson image deconvolution, which is a common problem occurring in number of imaging applications, such as limited photon acquisition or X-ray computed tomography. Numerical results show the efficiency and good adaptability of the proposed scheme compared to recent state-of-the-art techniques, for both high and low signal-to-noise ratio scenarios. This performance gain regardless of the amount of noise affecting the observations is explained by the flexibility of the embedded quantum denoiser constructed without anticipating any prior statistics about the noise, which is one of the main advantages of this method. The main novelty of this work resided in the integration of a modified quantum denoiser into the PnP-ADMM framework and the numerical proof of convergence of the resulting algorithm.
18 December 2023 in IEEE Signal Processing Letters
This letter presents a novel quantum algorithm for signal denoising, which performs a thresholding in the frequency domain through amplitude amplification and using an adaptive threshold determined by local mean values. The proposed algorithm is able to process both classical and quantum signals. It is parametrically faster than previous classical and quantum denoising algorithms. Numerical results show that it is efficient at removing noise of both classical and quantum origin, significantly outperforming existing quantum algorithms in this respect, especially in the presence of quantum noise.
Denoising is omnipresent in image processing. It is usually addressed with algorithms relying on a set of hyperparameters that control the quality of the recovered image. Manual tuning of those parameters can be a daunting task, which calls for the development of automatic tuning methods. Given a denoising algorithm, the best set of parameters is the one that minimizes the error between denoised and ground-truth images. Clearly, this ideal approach is unrealistic, as the ground-truth images are unknown in practice. In this work, we propose unsupervised cost functions—i.e., that only require the noisy image—that allow us to reach this ideal gold standard performance. Specifically, the proposed approach makes it possible to obtain an average PSNR output within less than 1% of the best achievable PSNR.