Near optimal compressed sensing without priors: Parametric SURE Approximate Message Passing

Abstract

Both theoretical analysis and empirical evidence confirm that the approximate message passing (AMP) algorithm can be interpreted as recursively solving a signal denoising problem: at each AMP iteration, one observes a Gaussian noise perturbed original signal. Retrieving the signal amounts to a successive noise cancellation until the noise variance decreases to a satisfactory level. In this paper we incorporate the Stein's unbiased risk estimate (SURE) based parametric denoiser with the AMP framework and propose the novel parametric SURE-AMP algorithm. At each parametric SURE-AMP iteration, the denoiser is adaptively optimized within the parametric class by minimizing SURE, which depends purely on the noisy observation. In this manner, the parametric SURE-AMP is guaranteed with the best-in-class recovery and convergence rate. If the parameter family includes the families of the mimimum mean squared error (MMSE) estimators, we are able to achieve the Bayesian optimal AMP performance without knowing the signal prior. In the paper, we resort to the linear parameterization of the SURE based denoiser and propose three different kernel families as the base functions. Numerical simulations with the Bernoulli-Gaussian, $k$-dense and Student's-t signals demonstrate that the parametric SURE-AMP does not only achieve the state-of-the-art recovery but also runs more than 20 times faster than the EM-GM-GAMP algorithm.

Part of the work will be presented at the European Signal Processing Conference, Lisbon, Portugal, September 2014

References in corpus (11)

• Message Passing Algorithms for Compressed Sensing
• The dynamics of message passing on dense graphs, with applications to compressed sensing
• Expectation-Maximization Gaussian-Mixture Approximate Message Passing
• Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing
• Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior
• Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices
• Statistical physics-based reconstruction in compressed sensing
• Compressive Imaging via Approximate Message Passing with Image Denoising
• A SURE Approach for Digital Signal/Image Deconvolution Problems
• Compressible Distributions for High-dimensional Statistics
• Parameterless Optimal Approximate Message Passing

Cited by in corpus (17)

• AMP-Inspired Deep Networks for Sparse Linear Inverse Problems
• On the Performance of Turbo Signal Recovery with Partial DFT Sensing Matrices
• Unsupervised Learning with Stein's Unbiased Risk Estimator
• Optimum window length of Savitzky-Golay filters with arbitrary order
• Projection onto Epigraph Sets for Rapid Self-Tuning Compressed Sensing MRI
• Approximate Message Passing with Parameter Estimation for Heavily Quantized Measurements
• Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals
• Device Activity Detection and Channel Estimation for Millimeter-Wave Massive MIMO
• Compressive Computed Tomography Reconstruction through Denoising Approximate Message Passing
• TFPnP: Tuning-free Plug-and-Play Proximal Algorithm with Applications to Inverse Imaging Problems
• A Probabilistic Bayesian Approach to Recover $R_2^{\ast }$ map and Phase Images for Quantitative Susceptibility Mapping
• Robust Equivariant Imaging: a fully unsupervised framework for learning to image from noisy and partial measurements
• Sparse Signal Recovery using Generalized Approximate Message Passing with Built-in Parameter Estimation
• D-OAMP: A Denoising-based Signal Recovery Algorithm for Compressed Sensing
• SUREMap: Predicting Uncertainty in CNN-based Image Reconstruction Using Stein's Unbiased Risk Estimate
• Asymptotic Statistical Analysis of Sparse Group LASSO via Approximate Message Passing Algorithm
• Denoising-based Turbo Compressed Sensing