Search NASA⌕ Search

Engineering topics

Maddali, S. (ORCID:0000000345166250)

Publications and source records attributed to Maddali, S. (ORCID:0000000345166250).

Sub-pixel high-resolution imaging of high-energy x-rays inspired by sub-wavelength optical imaging

We have developed and demonstrated an image super-resolution method—XR-UNLOC: X-Ray UNsupervised particle LOCalization—for hard x-rays measured with fast-frame-rate detectors that is an adaptation of the principle of photo-activated localization microscopy (PALM) and stochastic optical reconstruction microscopy (STORM), which enabled biological fluorescence imaging at sub-optical-wavelength scales. We demonstrate the approach on experimental coherent Bragg diffraction data measured with 52 keV x-rays from a nanocrystalline sample. From this sample, we resolve the fine fringe detail of a high-energy x-ray Bragg coherent diffraction pattern to an upsampling factor of 16 of the native pixel pitch of 30 μ m of a charge-integrating fastCCD detector. This was accomplished by analysis of individual photon locations in a series of “nearly-dark” instances of the diffraction pattern that each contain only a handful of photons. Central to our approach was the adaptation of the UNLOC photon fitting routine for PALM/STORM to the hard x-ray regime to handle much smaller point spread functions, which required a different statistical test for photon detection and for sub-pixel localization. A comparison to a photon-localization strategy used in the x-ray community (“droplet analysis”) showed that XR-UNLOC provides significant improvement in super-resolution. We also developed a metric by which to estimate the limit of reliable upsampling with XR-UNLOC under a given set of experimental conditions in terms of the signal-to-noise ratio of a photon detection event and the size of the point spread function for guiding future x-ray experiments in many disciplines where detector pixelation limits must be overcome.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient ptychographic phase retrieval via a matrix-free Levenberg-Marquardt algorithm

The phase retrieval problem, where one aims to recover a complex-valued image from far-field intensity measurements, is a classic problem encountered in a range of imaging applications. Modern phase retrieval approaches usually rely on gradient descent methods in a nonlinear minimization framework. Calculating closed-form gradients for use in these methods is tedious work, and formulating second order derivatives is even more laborious. Additionally, second order techniques often require the storage and inversion of large matrices of partial derivatives, with memory requirements that can be prohibitive for data-rich imaging modalities. We use a reverse-mode automatic differentiation (AD) framework to implement an efficient matrix-free version of the Levenberg-Marquardt (LM) algorithm, a longstanding method that finds popular use in nonlinear least-square minimization problems but which has seen little use in phase retrieval. Furthermore, we extend the basic LM algorithm so that it can be applied for more general constrained optimization problems (including phase retrieval problems) beyond just the least-square applications. Since we use AD, we only need to specify the physics-based forward model for a specific imaging application; the first and second-order derivative terms are calculated automatically through matrix-vector products, without explicitly forming the large Jacobian or Gauss-Newton matrices typically required for the LM method. We demonstrate that this algorithm can be used to solve both the unconstrained ptychographic object retrieval problem and the constrained “blind” ptychographic object and probe retrieval problems, under the popular Gaussian noise model as well as the Poisson noise model. We compare this algorithm to state-of-the-art first order ptychographic reconstruction methods to demonstrate empirically that this method outperforms best-in-class first-order methods: it provides excellent convergence guarantees with (in many cases) a superlinear rate of convergence, all with a computational cost comparable to, or lower than, the tested first-order algorithms.

36 MATERIALS SCIENCE↗