Experimental robustness of Fourier Ptychography phase retrieval algorithms
Li-Hao Yeh, Jonathan Dong, Jingshan Zhong, Lei Tian, Michael Chen,, Gongguo Tang, Mahdi Soltanolkotabi, and Laura Waller

TL;DR
This paper evaluates the robustness of Fourier ptychography phase retrieval algorithms, highlighting the importance of cost function choice and proposing a robust, efficient Newton's method for improved reconstruction under noise and calibration errors.
Contribution
It systematically compares inverse algorithms for Fourier ptychography, emphasizing the role of cost functions and introducing a robust Newton's method for enhanced performance.
Findings
Amplitude-based cost functions outperform intensity-based ones.
Noise and model mis-match errors scale with image intensity.
The proposed Newton's method improves robustness and efficiency.
Abstract
Fourier ptychography is a new computational microscopy technique that provides gigapixel-scale intensity and phase images with both wide field-of-view and high resolution. By capturing a stack of low-resolution images under different illumination angles, a nonlinear inverse algorithm can be used to computationally reconstruct the high-resolution complex field. Here, we compare and classify multiple proposed inverse algorithms in terms of experimental robustness. We find that the main sources of error are noise, aberrations and mis-calibration (i.e. model mis-match). Using simulations and experiments, we demonstrate that the choice of cost function plays a critical role, with amplitude-based cost functions performing better than intensity-based ones. The reason for this is that Fourier ptychography datasets consist of images from both brightfield and darkfield illumination, representing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
