From Denoising to Compressed Sensing

From MaRDI portal
Publication:2976641

DOI10.1109/TIT.2016.2556683zbMATH Open1359.94137arXiv1406.4175OpenAlexW2963676935MaRDI QIDQ2976641FDOQ2976641

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

Publication date: 28 April 2017

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

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.


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







Cited In (22)





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)