eess.IVJul 13, 2025

prNet: Data-Driven Phase Retrieval via Stochastic Refinement

Authors: Mehmet Onurcan Kaya, Figen S. Oktem

Abstract

Phase retrieval is an ill-posed inverse problem in which existing methods often struggle to balance reconstruction fidelity and perceptual quality. We propose a novel Langevin-based framework for phase retrieval that bridges model-driven and data-driven approaches by combining stochastic posterior sampling, learned denoising, and model-based updates to better navigate the perception-distortion tradeoff. The framework consists of three progressively more advanced variants. The first, prNet-Small, provides a theoretically grounded and lightweight pipeline that integrates Langevin dynamics with learned noise and denoising processes and alternating projection-based updates. Building upon this foundation, prNet-Large exploits parallel sampling of diverse reconstructions and aggregates them to approximate the MMSE solution, significantly improving distortion metrics. Finally, prNet-Large-Adversarial enhances perceptual quality by replacing simple averaging with an adversarially trained aggregation network while preserving reconstruction fidelity. In addition, we incorporate test time augmentation to further improve the performance. Extensive experiments demonstrate that the proposed framework consistently outperforms classical, deep learning-based, and diffusion-based baselines across multiple benchmarks in both reconstruction fidelity and perceptual quality. The source code and trained models are available at https://github.com/METU-SPACE-Lab/prNet-for-Phase-Retrieval

Figures & tables

Appendix figures & tables18 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Oct 12, 2026

Deeply unrolled alternating projections for phase retrieval

Deep unrolling methods for inverse problems augment traditional reconstruction algorithms with learned priors to improve their performance. These methods have been developed under the implicit assumption that the geometry of the measurement operator does not change between training and deployment; when this is no longer the case, the quality of obtained reconstructions can degrade significantly. In this paper, we argue that this is not an inherent limitation of the deep unrolling paradigm and can be mitigated by a careful choice of the underlying iterative algorithm. We propose a deep unrolling framework for the phase retrieval problem that augments the alternating projections method with a learned denoising step. Our method obtains high-quality reconstructions without the need for retraining in settings where conventional model-based alternatives struggle, such as when the dynamic range of the measurement operator changes significantly at test time.
Oct 30, 2026

FlowFPR: Flow Matching Prior for Oversampled Fourier Phase Retrieval

Fourier phase retrieval aims to reconstruct images from magnitude-only measurements; however, the absence of phase information, noises, and channel ambiguities make the recovery of natural color images challenging. Although diffusion-prior-based methods impose strong image constraints, their recovery performance degrades under higher measurement noise, and repeated generative updates incur substantial computational overhead. To overcome these limitations, this paper proposes a novel method, termed FlowFPR, that integrates a pretrained flow-matching prior with the relaxed averaged alternating reflections (RAAR) algorithm for oversampled Fourier phase retrieval. In the basic version of FlowPR (Flow-RAAR-basic), a color image is estimated by repeatedly performing four steps at each outer iteration, where the flow-prior prediction step exploits single-step straight-line prediction, considerably reducing the generation cost. Nevertheless, Flow-RAAR-basic still suffers from two critical issues: (i) the predefined fusion weights, λnλ_n, might lead to either ineffective or excessive correction, and (ii) the fixed iteration number used by RAAR algorithm does not allow adaptation to measurement noise. To address these two issues, we develop two improved algorithms, Flow-RAAR-adaptive and Flow-RAAR-controlled, respectively. Moreover, these two improved algorithms naturally lead to a joint variant, Flow-RAAR-joint, which combines their advantages. Extensive experiments on a natural face image dataset demonstrate the superior performance of the four proposed methods compared with other relevant competing methods, as well as their acceleration over two recent diffusion-based methods. In the noise setting, Flow-RAAR-joint performs best among the four proposed methods.
Jun 5, 2026

On the conditional equivalence of phase retrieval algorithms

Phase retrieval - recovering a complex-valued field from intensity measurements - is typically solved using variants of the Gerchberg-Saxton (GS) algorithm, understood as alternating projections between measurement planes. Meanwhile, modern computational imaging increasingly relies on gradient-based optimization and automatic differentiation. Here we show that these two approaches are mathematically identical: the GS magnitude replacement step is exactly a unit gradient descent step on an amplitude least-squares loss. This equivalence enables seamless integration of classical phase retrieval with differentiable physics pipelines. We further identify two complementary probabilistic interpretations of this equivalence: globally, the amplitude loss is the negative log-likelihood under Gaussian amplitude noise; locally, each projection step arises as a Bayesian update with the propagated field as prior. The local view provides qualitative guidance for relaxation in iterative phase retrieval.