z-logo
open-access-imgOpen Access
Ptychographic overlap constraint errors and the limits of their numerical recovery using conjugate gradient descent methods
Author(s) -
Ashish Tripathi,
Ian McNulty,
Oleg Shpyrko
Publication year - 2014
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.22.001452
Subject(s) - diffraction , optics , ptychography , sample (material) , image resolution , conjugate gradient method , phase retrieval , resolution (logic) , physics , gradient descent , image quality , computer science , algorithm , image (mathematics) , fourier transform , artificial intelligence , quantum mechanics , artificial neural network , thermodynamics
Ptychographic coherent x-ray diffractive imaging is a form of scanning microscopy that does not require optics to image a sample. A series of scanned coherent diffraction patterns recorded from multiple overlapping illuminated regions on the sample are inverted numerically to retrieve its image. The technique recovers the phase lost by detecting the diffraction patterns by using experimentally known constraints, in this case the measured diffraction intensities and the assumed scan positions on the sample. The spatial resolution of the recovered image of the sample is limited by the angular extent over which the diffraction patterns are recorded and how well these constraints are known. Here, we explore how reconstruction quality degrades with uncertainties in the scan positions. We show experimentally that large errors in the assumed scan positions on the sample can be numerically determined and corrected using conjugate gradient descent methods. We also explore in simulations the limits, based on the signal to noise of the diffraction patterns and amount of overlap between adjacent scan positions, of just how large these errors can be and still be rendered tractable by this method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here