From Denoising to Compressed Sensing

DOI10.1109/TIT.2016.2556683MaRDI QIDQ2976641zbMATH OpenOpenAlexFDO

Authors Christoher A. Metzler, Arian Maleki, Richard G. Baraniuk

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1406.4175

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: 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.

Cited in

(22)

• Bayesian approach with extended support estimation for sparse linear regression
• From Bernoulli–Gaussian Deconvolution to Sparse Signal Restoration
• Learnable descent algorithm for nonsmooth nonconvex image reconstruction
• Plug in estimation in high dimensional linear inverse problems a rigorous analysis
• Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
• Regularization by denoising via fixed-point projection (RED-PRO)
• scientific article; zbMATH DE number 6311302 (Why is no real title available?)
• Noisy linear inverse problems under convex constraints: exact risk asymptotics in high dimensions
• Fast and reliable parameter estimation from nonlinear observations
• Backtracking-based iterative regularization method for image compressive sensing recovery
• MB-DAMPNet: a novel multi-branch denoising-based approximate message passing algorithm via deep neural network for image reconstruction
• An introduction to compressed sensing
• Image Denoising: The Deep Learning Revolution and Beyond—A Survey Paper
• Multienergy cone-beam computed tomography reconstruction with a spatial spectral nonlocal means algorithm
• Bayesian Imaging Using Plug & Play Priors: When Langevin Meets Tweedie
• Denoising AMP for MRI reconstruction: BM3D-AMP-MRI
• Robust and stable region-of-interest tomographic reconstruction using a robust width prior
• scientific article; zbMATH DE number 7625169 (Why is no real title available?)
• Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
• Bayesian Imaging with Data-Driven Priors Encoded by Neural Networks
• Compressive Computed Tomography Reconstruction through Denoising Approximate Message Passing
• Content-aware compressive sensing recovery using Laplacian scale mixture priors and side information

This page was built for publication: From Denoising to Compressed Sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976641)