اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPartially Coherent Ptychography by Gradient Decomposition of the Probe
53
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Coherent ptychographic imaging experiments often discard over 99.9 % of the flux from a light source to define the coherence of an illumination. Even when coherent flux is sufficient, the stability required during an exposure is another important limiting factor. Partial coherence analysis can considerably reduce these limitations. A partially coherent illumination can often be written as the superposition of a single coherent illumination convolved with a separable translational kernel. In this paper we propose the Gradient Decomposition of the Probe (GDP), a model that exploits translational kernel separability, coupling the variances of the kernel with the transverse coherence. We describe an efficient first-order splitting algorithm GDP-ADMM to solve the proposed nonlinear optimization problem. Numerical experiments demonstrate the effectiveness of the proposed method with Gaussian and binary kernel functions in fly-scan measurements. Remarkably, GDP-ADMM produces satisfactory results even when the ratio between kernel width and beam size is more than one, or when the distance between successive acquisitions is twice as large as the beam width.
قيم البحث
اقرأ أيضاً
Ptychography is a promising phase retrieval technique for visible light, X-ray and electron beams. Conventional ptychography reconstructs the amplitude and phase of an object light from a set of the diffraction intensity patterns obtained by the X-Y
moving of the probe light. The X-Y moving of the probe light requires two control parameters and accuracy of the locations. We propose ptychography by changing the area of the probe light using only one control parameter, instead of the X-Y moving of the probe light. The proposed method has faster convergence speed. In addition, we propose scaled ptychography using scaled diffraction calculation in order to magnify retrieved object lights clearly.
Adaptive gradient methods, especially Adam-type methods (such as Adam, AMSGrad, and AdaBound), have been proposed to speed up the training process with an element-wise scaling term on learning rates. However, they often generalize poorly compared wit
h stochastic gradient descent (SGD) and its accelerated schemes such as SGD with momentum (SGDM). In this paper, we propose a new adaptive method called DecGD, which simultaneously achieves good generalization like SGDM and obtain rapid convergence like Adam-type methods. In particular, DecGD decomposes the current gradient into the product of two terms including a surrogate gradient and a loss based vector. Our method adjusts the learning rates adaptively according to the current loss based vector instead of the squared gradients used in Adam-type methods. The intuition for adaptive learning rates of DecGD is that a good optimizer, in general cases, needs to decrease the learning rates as the loss decreases, which is similar to the learning rates decay scheduling technique. Therefore, DecGD gets a rapid convergence in the early phases of training and controls the effective learning rates according to the loss based vectors which help lead to a better generalization. Convergence analysis is discussed in both convex and non-convex situations. Finally, empirical results on widely-used tasks and models demonstrate that DecGD shows better generalization performance than SGDM and rapid convergence like Adam-type methods.
We investigate the Goos-H{a}nchen (GH) shifts of partially coherent fields (PCFs) by using the theory of coherence. We derive a formal expression for the GH shifts of PCFs in terms of Mercers expansion, and then clearly demonstrate the dependence of
the GH shift of each mode of PCFs on spatial coherence and beam width. We discuss the effect of spatial coherence on the resultant GH shifts, especially for the cases near the critical angles, such as totally reflection angle.
We present the ptychography reconstruction of the x-ray beam formed by nanofocusing lenses (NFLs) containing a number of phase singularities (vortices) in the vicinity of the focal plane. As a test object Siemens star pattern was used with the finest
features of 50 nm for ptychography measurements. The extended ptychography iterative engine (ePIE) algorithm was applied to retrieve both complex illumination and object functions from the set of diffraction patterns. The reconstruction revealed the focus size of 91.4$pm$1.1 nm in horizontal and 70$pm$0.3 nm in vertical direction at full width at half maximum (FWHM). The complex probe function was propagated along the optical axis of the beam revealing the evolution of the phase singularities.
The success of ptychographic imaging experiments strongly depends on achieving high signal-to-noise ratio. This is particularly important in nanoscale imaging experiments when diffraction signals are very weak and the experiments are accompanied by s
ignificant parasitic scattering (background), outliers or correlated noise sources. It is also critical when rare events such as cosmic rays, or bad frames caused by electronic glitches or shutter timing malfunction take place. In this paper, we propose a novel iterative algorithm with rigorous analysis that exploits the direct forward model for parasitic noise and sample smoothness to achieve a thorough characterization and removal of structured and random noise. We present a formal description of the proposed algorithm and prove its convergence under mild conditions. Numerical experiments from simulations and real data (both soft and hard X-ray beamlines) demonstrate that the proposed algorithms produce better results when compared to state-of-the-art methods.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
