Overlapping Domain Decomposition Methods for Ptychographic Imaging

by   Huibin Chang, et al.

In ptychography experiments, redundant scanning is usually required to guarantee the stable recovery, such that a huge amount of frames are generated, and thus it poses a great demand of parallel computing in order to solve this large-scale inverse problem. In this paper, we propose the overlapping Domain Decomposition Methods (DDMs) to solve the nonconvex optimization problem in ptychographic imaging, that decouple the problem defined on the whole domain into subproblems only defined on the subdomains with synchronizing information on the interface of these subdomains, thus leading to highly parallel algorithms with good load balance. More specifically, for the nonblind recovery (with known probe in advance), by enforcing the continuity of the overlapping region for the image (sample), the nonlinear optimization model is established based on a novel smooth-truncated amplitude-Gaussian metric. Then the Alternating Direction Method of Multipliers (ADMM) is utilized to generate an efficient Overlapping Domain Decomposition based Ptychography algorithm (OD2P) for the two-subdomain domain decomposition (DD), where all subproblems can be computed with close-form solutions. Due to the Lipschitz continuity for the gradient of the objective function, the convergence of the proposed OD2P is derived under mild conditions. Moreover, it is extended to more general case including multiple-subdomain DD and blind recovery. Numerical experiments are further conducted to show the performance of proposed algorithms, demonstrating good convergence speed and robustness to the noise. Especially, we report the virtual wall-clock time of proposed algorithm, which shows great potential for parallel computing in massively parallel processing computers.


page 17

page 18

page 19

page 20


Partition-Insensitive Parallel ADMM Algorithm for High-dimensional Linear Models

The parallel alternating direction method of multipliers (ADMM) algorith...

Parallel Domain Decomposition techniques applied to Multivariate Functional Approximation of discrete data

Compactly expressing large-scale datasets through Multivariate Functiona...

Efficient Alternating Least Squares Algorithms for Truncated HOSVD of Higher-Order Tensors

The truncated Tucker decomposition, also known as the truncated higher-o...

Sharp bounds on Helmholtz impedance-to-impedance maps and application to overlapping domain decomposition

We prove sharp bounds on certain impedance-to-impedance maps (and their ...

Preconditioned Algorithm for Difference of Convex Functions with applications to Graph Ginzburg-Landau Model

In this work, we propose and study a preconditioned framework with a gra...

A Fast Minimization Algorithm for the Euler Elastica Model Based on a Bilinear Decomposition

The Euler Elastica (EE) model with surface curvature can generate artifa...

Through the Wall Radar Imaging via Kronecker-structured Huber-type RPCA

The detection of multiple targets in an enclosed scene, from its outside...

Please sign up or login with your details

Forgot password? Click here to reset