Denoising based Vector Approximate Message Passing
نویسندگان
چکیده
The D-AMP methodology, recently proposed by Metzler, Maleki, and Baraniuk, allows one to plug in sophisticated denoisers like BM3D into the AMP algorithm to achieve state-of-the-art compressive image recovery. But AMP diverges with small deviations from the i.i.d.-Gaussian assumption on the measurement matrix. Recently, the VAMP algorithm has been proposed to fix this problem. In this work, we show that the benefits of VAMP extend to D-VAMP. Consider the problem of recovering a (vectorized) image x0 ∈ R from compressive (i.e., M ≪ N ) noisy linear measurements y = Φx0 +w ∈ R M , (1) known as “compressive imaging.” The “sparse” approach to this problem exploits sparsity in the coefficients v0 , Ψx0 ∈ R N of an orthonormal wavelet transform Ψ. The idea is to rewrite (1) as y = Av0 +w for A , ΦΨ , (2) recover an estimate v̂ of v0 from y, and then construct the image estimate as x̂ = Ψ v̂. Although many algorithms have been proposed for sparse recovery of v0, a notable one is the approximate message passing (AMP) algorithm from [1]. It is computationally efficient (i.e., one multiplication by A and A per iteration and relatively few iterations) and its performance, when M and N are large and Φ is zero-mean i.i.d. Gaussian, is rigorously characterized by a scalar state evolution. A variant called “denoising-based AMP” (D-AMP) was recently proposed [2] for direct recovery of x0 from (1). It exploits the fact that, at iteration t, AMP constructs a pseudo-measurement of the form v0 + N (0, σ t I) with known σ t , which is amenable to any image denoising algorithm. By plugging in a state-of-the-art image denoiser like BM3D [3], D-AMP yields state-of-the-art compressive imaging. AMP and D-AMP, however, have a serious weakness: they diverge under small deviations from the zero-mean i.i.d. Gaussian assumption on Φ, such as non-zero mean or mild ill-conditioning. A robust alternative called “vector AMP” (VAMP) was recently proposed [4]. VAMP has similar complexity to AMP and a rigorous state evolution November 7, 2016 DRAFT
منابع مشابه
Denoising Message Passing for X-ray Computed Tomography Reconstruction
X-ray Computed Tomography (CT) reconstruction from sparse number of views is becoming a powerful way to reduce either the radiation dose or the acquisition time in CT systems but still requires a huge computational time. This paper introduces an approximate Bayesian inference framework for CT reconstruction based on a family of denoising approximate message passing (DCT-AMP) algorithms able to ...
متن کاملCompressed Sensing via Universal Denoising and Approximate Message Passing
We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics are unknown; the goal is to provide reconstruction algorithms that are universal to the input statistics. We present a novel algorithm that combines: (i) the...
متن کاملLearned D-AMP: A Principled CNN-based Compressive Image Recovery Algorithm
Compressive image recovery is a challenging problem that requires fast and accurate algorithms. Recently, neural networks have been applied to this problem with promising results. By exploiting massively parallel GPU processing architectures and oodles of training data, they are able to run orders of magnitude faster than existing methods. Unfortunately, these methods are difficult to train, of...
متن کاملApproximate Message Passing with Universal Denoising
We study compressed sensing (CS) signal reconstruction problems where an input signal is measured via matrix multiplication under additive white Gaussian noise. Our signals are assumed to be stationary and ergodic, but the input statistics are unknown; the goal is to provide reconstruction algorithms that are universal to the input statistics. We present a novel algorithmic framework that combi...
متن کاملAsymptotic Analysis of LASSOs Solution Path with Implications for Approximate Message Passing
This paper concerns the performance of the LASSO (also knows as basis pursuit denoising) for recovering sparse signals from undersampled, randomized, noisy measurements. We consider the recovery of the signal xo ∈ R from n random and noisy linear observations y = Axo + w, where A is the measurement matrix and w is the noise. The LASSO estimate is given by the solution to the optimization proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1611.01376 شماره
صفحات -
تاریخ انتشار 2016