Compressive Phase Retrieval via Generalized Approximate Message Passing
arXiv:1405.5618 · doi:10.1109/TSP.2014.2386294
Abstract
In phase retrieval, the goal is to recover a signal from the magnitudes of linear measurements . While recent theory has established that intensity measurements are necessary and sufficient to recover generic , there is great interest in reducing the number of measurements through the exploitation of sparse , which is known as compressive phase retrieval. In this work, we detail a novel, probabilistic approach to compressive phase retrieval based on the generalized approximate message passing (GAMP) algorithm. We then present a numerical study of the proposed PR-GAMP algorithm, demonstrating its excellent phase-transition behavior, robustness to noise, and runtime. Our experiments suggest that approximately intensity measurements suffice to recover -sparse Bernoulli-Gaussian signals for with i.i.d Gaussian entries and . Meanwhile, when recovering a 6k-sparse 65k-pixel grayscale image from 32k randomly masked and blurred Fourier intensity measurements at 30~dB measurement SNR, PR-GAMP achieved an output SNR of no less than 28~dB in all of 100 random trials, with a median runtime of only 7.3 seconds. Compared to the recently proposed CPRL, sparse-Fienup, and GESPAR algorithms, our experiments suggest that PR-GAMP has a superior phase transition and orders-of-magnitude faster runtimes as the sparsity and problem dimensions increase.
References in corpus (3)
Cited by in corpus (6)
- Compressive Phase Retrieval via Generalized Approximate Message Passing
- Learning-based real-time method to looking through scattering medium beyond the memory effect
- The estimation error of general first order methods
- A general framework for denoising phaseless diffraction measurements
- Fast Compressive Phase Retrieval from Fourier Measurements
- -regularized Variational Methods for Sparse Phase Retrieval