Using Convex Optimization of Autocorrelation with Constrained Support and Windowing for Improved Phase Retrieval Accuracy
arXiv:1804.06724 · doi:10.1364/OE.26.024422
Abstract
In imaging modalities recording diffraction data, the original image can be reconstructed assuming known phases. When phases are unknown, oversampling and a constraint on the support region in the original object can be used to solve a non-convex optimization problem. Such schemes are ill-suited to find the optimum solution for sparse data, since the recorded image does not correspond exactly to the original wave function. We construct a convex optimization problem using a relaxed support constraint and a maximum-likelihood treatment of the recorded data as a sample from the underlying wave function. We also stress the need to use relevant windowing techniques to account for the sampled pattern being finite. On simulated data, we demonstrate the benefits of our approach in terms of visual quality and an improvement in the crystallographic R-factor from .4 to .1 for highly noisy data.
arXiv comment19 pages, 4 figures, 1 table
References in corpus (10)
- Phase recovery and holographic image reconstruction using deep learning in neural networks
- Femtosecond Diffractive Imaging with a Soft-X-ray Free-Electron Laser
- X-ray image reconstruction from a diffraction pattern alone
- Templates for Convex Cone Problems with Applications to Sparse Signal Recovery
- A unified evaluation of iterative projection algorithms for phase retrieval
- Relaxed Averaged Alternating Reflections for Diffraction Imaging
- Oversampling smoothness (OSS): an effective algorithm for phase retrieval of noisy diffraction intensities
- Three-dimensional structure determination from a single view
- Phase Retrieval from 1D Fourier Measurements: Convexity, Uniqueness, and Algorithms
- Recovering magnetization distributions from their noisy diffraction data