Generalized Proximal Smoothing for Phase Retrieval

DOI10.1364/OE.27.002792arXiv1803.05610WikidataQ91404694 ScholiaQ91404694MaRDI QIDQ6299088FDOQ6299088

Authors: Minh Tu Pham, Penghang Yin, Arjun Rana, Stanley Osher, Jiawei Miao 

Publication date: 15 March 2018

Abstract: In this paper, we report the development of the generalized proximal smoothing (GPS) algorithm for phase retrieval of noisy data. GPS is a optimization-based algorithm, in which we relax both the Fourier magnitudes and object constraints. We relax the object constraint by introducing the generalized Moreau-Yosida regularization and heat kernel smoothing. We are able to readily handle the associated proximal mapping in the dual variable by using an infimal convolution. We also relax the magnitude constraint into a least squares fidelity term, whose proximal mapping is available. GPS alternatively iterates between the two proximal mappings in primal and dual spaces, respectively. Using both numerical simulation and experimental data, we show that GPS algorithm consistently outperforms the classical phase retrieval algorithms such as hybrid input-output (HIO) and oversampling smoothness (OSS), in terms of the convergence speed, consistency of the phase retrieval, and robustness to noise.

This page was built for publication: Generalized Proximal Smoothing for Phase Retrieval

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