From Denoising to Compressed Sensing
A denoising algorithm seeks to remove noise, errors, or perturbations from a signal. Extensive research has been devoted to this arena over the last several decades, and as a result, today's denoisers can effectively remove large amounts of additive white Gaussian noise. A compressed sensing (CS) reconstruction algorithm seeks to recover a structured signal acquired using a small number of randomized measurements. Typical CS reconstruction algorithms can be cast as iteratively estimating a signal from a perturbed observation. This paper answers a natural question: How can one effectively employ a generic denoiser in a CS reconstruction algorithm? In response, we develop an extension of the approximate message passing (AMP) framework, called Denoising-based AMP (D-AMP), that can integrate a wide class of denoisers within its iterations. We demonstrate that, when used with a high performance denoiser for natural images, D-AMP offers state-of-the-art CS recovery performance while operating tens of times faster than competing methods. We explain the exceptional performance of D-AMP by analyzing some of its theoretical features. A key element in D-AMP is the use of an appropriate Onsager correction term in its iterations, which coerces the signal perturbation at each iteration to be very close to the white Gaussian noise that denoisers are typically designed to remove.
Code (2)
Tasks
compressed sensingDenoisingSimilar Papers 제목 키워드 기반
Compressed Sensing with Invertible Generative Models and Dependent Noise
We study image inverse problems with invertible generative priors, specifically normalizing flow models. Our formulation views the solution as the maximum a posteriori (MAP) estimate of the image given the measurements. …
compressed sensingDenoisingDenoising guarantees for optimized sampling schemes in compressed sensing
Compressed sensing with subsampled unitary matrices benefits from \emph{optimized} sampling schemes, which feature improved theoretical guarantees and empirical performance relative to uniform subsampling. We provide, in…
compressed sensingDenoisingVariational Quantum Compressed Sensing for Joint User and Channel State Acquisition in Grant-Free Device Access Systems
This paper introduces a new quantum computing framework integrated with a two-step compressed sensing technique, applied to a joint channel estimation and user identification problem. We propose a variational quantum cir…
compressed sensingDenoisingUser IdentificationImpulse Denoising From Hyper-Spectral Images: A Blind Compressed Sensing Approach
In this work we propose a technique to remove sparse impulse noise from hyperspectral images. Our algorithm accounts for the spatial redundancy and spectral correlation of such images. The proposed method is based on the…
compressed sensingDenoisingDictionary LearningPartially deterministic sampling for compressed sensing with denoising guarantees
We study compressed sensing when the sampling vectors are chosen from the rows of a unitary matrix. In the literature, these sampling vectors are typically chosen randomly; the use of randomness has enabled major empiric…