Overlapping domain decomposition methods for ptychographic imaging
From MaRDI portal
Publication:4997367
parallel computingphase retrievalptychographyoverlapping domain decomposition methodblind recoverysmooth truncated amplitude-Gaussian metric
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Nonlinear programming (90C30) Ill-posedness and regularization problems in numerical linear algebra (65F22) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Problems with incomplete information (optimization) (49N30) Inverse problems (including inverse scattering) in optics and electromagnetic theory (78A46)
Abstract: 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. They decouple the problem defined on the whole domain into subproblems only defined on the subdomains with synchronizing information in the overlapping regions 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 regions for the image (sample), the nonlinear optimization model is established based on a novel smooth-truncated amplitude-Gaussian metric (ST-AGM). Such metric allows for fast calculation of the proximal mapping with closed form, and meanwhile provides the possibility for the convergence guarantee of the first-order nonconvex optimization algorithm due to its Lipschitz smoothness. 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 with ST-AGM, 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.
Recommendations
- Solving blind ptychography effectively via linearized alternating direction method of multipliers
- Proximal heterogeneous block implicit-explicit method and application to blind ptychographic diffraction imaging
- Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
- Iterative Algorithms for Ptychographic Phase Retrieval
- Coded aperture ptychography: uniqueness and reconstruction
Cites work
- scientific article; zbMATH DE number 4076515 (Why is no real title available?)
- scientific article; zbMATH DE number 4080827 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 671790 (Why is no real title available?)
- A convergent overlapping domain decomposition method for total variation minimization
- A finite element approach for the dual Rudin-Osher-Fatemi model and its nonoverlapping domain decomposition methods
- A parallel domain decomposition algorithm for large scale image denoising
- A two-level domain decomposition method for image restoration
- Alternating direction methods for classical and ptychographic phase retrieval
- Alternating projection, ptychographic imaging and phase synchronization
- Augmented Lagrangian method, dual methods, and split Bregman iteration for ROF, vectorial TV, and high order models
- Blind Ptychographic Phase Retrieval via Convergent Alternating Direction Method of Multipliers
- Convergence rate of overlapping domain decomposition methods for the Rudin-Osher-Fatemi model based on a dual formulation
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Domain decomposition methods for nonlocal total variation image restoration
- Domain decomposition methods for recovering Robin coefficients in elliptic and parabolic systems
- Fixed point analysis of Douglas-Rachford splitting for ptychography and phase retrieval
- Overlapping domain decomposition methods for linear inverse problems
- Overlapping domain decomposition methods for total variation denoising
- Partially coherent ptychography by gradient decomposition of the probe
- Primal domain decomposition methods for the total variation minimization, based on dual decomposition
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal heterogeneous block implicit-explicit method and application to blind ptychographic diffraction imaging
- Total variation-based phase retrieval for Poisson noise removal
Cited in
(6)- A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion
- Spherical Image Inpainting with Frame Transformation and Data-Driven Prior Deep Networks
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
- A stochastic ADMM algorithm for large-scale ptychography with weighted difference of anisotropic and isotropic total variation
- Proximal heterogeneous block implicit-explicit method and application to blind ptychographic diffraction imaging
- Proximal gradient methods for general smooth graph total variation model in unsupervised learning
This page was built for publication: Overlapping domain decomposition methods for ptychographic imaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4997367)
