Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA matrix-free Levenberg-Marquardt algorithm for efficient ptychographic phase retrieval
429
0
0.0
(
0
)
Added by
Saugat Kandel
Publication date
2021
fields
Electronic Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
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 general constrained optimization 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 derivative terms are calculated automatically through matrix-vector products, without explicitly forming any large Jacobian or Gauss-Newton matrices. 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 both the Gaussian and Poisson noise models, and that this method outperforms best-in-class first-order ptychographic reconstruction 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.
rate research
Read More
Implementations in R of classical general-purpose algorithms generally have two major limitations which make them unusable in complex problems: too loose convergence criteria and too long calculation time. By relying on a Marquardt-Levenberg algorithm (MLA), a Newton-like method particularly robust for solving local optimization problems, we provide with marqLevAlg package an efficient and general-purpose local optimizer which (i) prevents convergence to saddle points by using a stringent convergence criterion based on the relative distance to minimum/maximum in addition to the stability of the parameters and of the objective function; and (ii) reduces the computation time in complex settings by allowing parallel calculations at each iteration. We demonstrate through a variety of cases from the literature that our implementation reliably and consistently reaches the optimum (even when other optimizers fail), and also largely reduces computational time in complex settings through the example of maximum likelihood estimation of different sophisticated statistical models.
The inverse problem in Acousto-Electric tomography concerns the reconstruction of the electric conductivity in a domain from knowledge of the power density function in the interior of the body. This interior power density results from currents prescribed at boundary electrodes (and can be obtained through electro-static boundary measurements together with auxiliary acoustic measurement. In Electrical Impedance Tomography, the complete electrode model is known to be the most accurate model for the forward modelling. In this paper, the reconstruction problem of Acousto-Electric tomography is posed using the (smooth) complete electrode model, and a Levenberg-Marquardt iteration is formulated in appropriate function spaces. This results in a system of partial differential equations to be solved in each iteration. To increase the computational efficiency and stability, a strategy based on both the complete electrode model and the continuum model with Dirichlet boundary condition is proposed. The system of equations is implemented numerically for a two dimensional scenario and the algorithm is tested on two different numerical phantoms, a heart and lung model and a human brain model. Several numerical experiments are carried out confirming the feasibility, accuracy and stability of the methods.
Ptychography is a popular imaging technique that combines diffractive imaging with scanning microscopy. The technique consists of a coherent beam that is scanned across an object in a series of overlapping positions, leading to reliable and improved reconstructions. Ptychographic microscopes allow for large fields to be imaged at high resolution at the cost of additional computational expense. In this work, we propose a multigrid-based optimization framework to reduce the computational burdens of large-scale ptychographic phase retrieval. Our proposed method exploits the inherent hierarchical structures in ptychography through tailored restriction and prolongation operators for the object and data domains. Our numerical results show that our proposed scheme accelerates the convergence of its underlying solver and outperforms the Ptychographic Iterative Engine (PIE), a workhorse in the optics community.
Recently, efforts have been made to improve ptychography phase retrieval algorithms so that they are more robust against noise. Often the algorithm is adapted by changing the cost functional that needs to be minimized. In particular, it has been suggested that the cost functional should be obtained using a maximum-likelihood approach that takes the noise statistics into account. Here, we consider the different choices of cost functional, and to how they affect the reconstruction results. We find that seemingly the only consistently reliable way to improve reconstruction results in the presence of noise is to reduce the step size of the update function. In addition, a noise-robust ptychographic reconstruction method has been proposed that relies on adapting the intensity constraints
Coherent X-ray beams with energies $geq 50$ keV can potentially enable three-dimensional imaging of atomic lattice distortion fields within individual crystallites in bulk polycrystalline materials through Bragg coherent diffraction imaging (BCDI). However, the undersampling of the diffraction signal due to Fourier space compression at high X-ray energies renders conventional phase retrieval algorithms unsuitable for three-dimensional reconstruction. To address this problem we utilize a phase retrieval method with a Fourier constraint specifically tailored for undersampled diffraction data measured with coarse-pitched detector pixels that bin the underlying signal. With our approach, we show that it is possible to reconstruct three-dimensional strained crystallites from an undersampled Bragg diffraction data set subject to pixel-area integration without having to physically upsample the diffraction signal. Using simulations and experimental results, we demonstrate that explicit modeling of Fourier space compression during phase retrieval provides a viable means by which to invert high-energy BCDI data, which is otherwise intractable.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
