Next Article in Journal
The Effect of Temperature on the Surface Energetic Properties of Carbon Fibers Using Inverse Gas Chromatography
Next Article in Special Issue
Scattering of Ultrashort X-ray Pulses from Oriented NV Centers in the Diamond Structure
Previous Article in Journal
Novel High-Temperature Modification of Belomarinaite KNaSO4: Crystal Structure and Thermal Order–Disorder Phase Transitions
Previous Article in Special Issue
X-ray Crystal Structure, Hirshfeld Surface Analysis, DFT, and Anticancer Effect of 3-Hydroxy-4-phenyl-1,5-benzodiazepin-2-one Derivatives
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Comprehensive Recovery of Point Defect Displacement Field Function in Crystals by Computer X-ray Diffraction Microtomography

by
Felix N. Chukhovskii
*,
Petr V. Konarev
and
Vladimir V. Volkov
A.V. Shubnikov Institute of Crystallography, Federal Scientific Research Centre “Crystallography and Photonics”, Russian Academy of Sciences, 59, Leninsky prospect, 119333 Moscow, Russia
*
Author to whom correspondence should be addressed.
Crystals 2024, 14(1), 29; https://doi.org/10.3390/cryst14010029
Submission received: 29 November 2023 / Revised: 21 December 2023 / Accepted: 24 December 2023 / Published: 26 December 2023

Abstract

:
In the case of the point defect in a crystal, the inverse Radon’s problem in X-ray diffraction microtomography has been solved. As is known, the crystal-lattice defect displacement field function f(r) = h·u(r) determines phases − (±h)-structure factors incorporated into the Takagi–Taupin equations and provides the 2D image patterns by diffracted and transmitted waves propagating through a crystal (h is the diffraction vector and u(r) is the displacement field crystal-lattice-defects vector). Beyond the semi-kinematical approach for obtaining the analytical problem solution, the difference-equations-scheme of the Takagi–Taupin equations that, in turn, yield numerically controlled-accuracy problem solutions has been first applied and tested. Addressing the inverse Radon’s problem solution, the χ2-target function optimization method using the Nelder–Mead algorithm has been employed and tested in an example of recovering the Coulomb-type point defect structure in a crystal Si(111). As has been shown in the cases of the 2D noise-free fractional and integrated image patterns, based on the Takagi–Taupin solutions in the semi-kinematical and difference-scheme approaches, both procedures provide the χ2-target function global minimum, even if the starting-values of the point-defect vector P 1  is chosen rather far away from the reference up to 40% in relative units. In the cases of the 2D Poisson-noise image patterns with noise levels up to 5%, the figures-of-merit values of the optimization procedures by the Nelder–Mead algorithm turn out to be high enough; the lucky trials number is 85%; and in contrast, for the statistically denoised 2D image patterns, they reach 0.1%.

1. Introduction

There is nothing supernova if one says the innovative method of computed X-ray diffraction microtomography promotes ongoing tomorrow’s perspectives for the studies of crystal-lattice-defects, pushing one step further by propelling innovations in the semiconductor materials investigation to a more smart level in fabricating new nanoscaled structures with advanced electronic and optical properties. It will occur due to the development and application of relevant high-resolution X-ray diffraction techniques, reciprocal-space mapping (RSM) [1,2,3,4,5], and computer-aided X-ray diffraction microtomography (XRDMT) [5,6,7,8,9,10]. Both gather the 2D image pattern (IP) information recorded within the reciprocal and direct spaces, and these are utilized to decode the 2D IP data in the materials diagnostics. In the concept of a direct method, by decoding the reference 2D IP data, one can recover the crystal-lattice defect structure (see [9,10]). The latter is solving the inverse Radon problem in the XRDMT using the measured and model-simulated 2D IP data to restore the point defect displacement field function in crystals, where the figure-of-merit (FOM) value of recovery depends on the noise level of the 2D Poisson noise IP data. As was shown in [10], the noise- filtering of the 2D IP data with 3–10% noisy levels yields a reduction in the noise level of the order of their values, at least decreasing the convergence FOMs in processing the χ2-target function optimization. One have demonstrated that the 2D IP data denoising effect is effective and can be achieved by statistically averaging several noise-contaminated 2D IP data sets [10].
Further, one uses the term “denoising the 2D IP data” as a sense of digitally noisy filtering without harming the reference signal in the 2D detector pixel. On the contrary, some noisy-filtering methods [11,12,13,14], e.g., the singular-value decomposition-based denoising method [11], the convolutional neural networks [12], bilateral filtering [13], and Hamming’s method [14], lead to uncontrolled digital accuracy of the reference 2D IP data in the post-processing stage.
The present study is a comprehensive exploration of recovering the nanoscale point defect structure in the case of a spherical inclusion incorporated in the middle of the plane-parallel plate of crystal Si(111). An incident X-ray radiation is the monochromatic linear-polarized plane wave with wavelength λ = 0.0709 nm, the X-ray extinction length Λ = 36.287 μm, the diffraction vector is h = 2 2 ¯ 0 , the Bragg angle θB = 10.65°.
The displacement field function f C t p d r r 0 around the spherical inclusion located at point r = r0 is given by the Coulomb-type function.
f C t p d r r 0 = F 4 π h x ( x 2 + y 2 + z z 0 2 ) ν + ε
where  ν = 3 2 , F = c o n s t , ε + 0
Hereafter, the thin crystal Si(111) is the plane-parallel plate, and the sample thickness T is assumed to be Λ. Each of the integrated (entire) 2D IP data frames simulated with square lateral dimension 2 Λ × 2 Λ contains 182 × 182 pixels. Accordingly, the linear size of each pixel is about 0.4 μm. In accordance with the characteristics of ESRF-Grenoble synchrotron facilities, the spatial resolution of the CCD hybrid detectors employed at the X-ray diffraction tomography beamlines is about 1 μm, the X-ray flux are about 103 per pixel, and the exposure time is 0.1 sec. per 2D IP data frame.
The investigation goal is the comprehensive recovery of the reference vector P t r u e = { ν ,     z 0 , F } characterizing the displacement field function (1) being retrieved with controlled by FOM-value digital accuracy using the modeling of 2D Poisson-noise IP data frames in both approaches of the semi-kinematical [10] and the difference-scheme [15] for solving the Takagi–Taupin equations in the XRDMT optics.
The schematic of the XRDMT setup is drawn in Figure 1.
It allows bringing the 2D IP data to the frame multimode regime when several 2D IP data frames can be recorded in the sample rotation angle value to be fixed. Such a setup is necessary for improving the single-pixel signal-to-noise ratio by acquiring the 2D IP data frames.
In general, the χ2-target function F P k is defined as
F P k = 1 N , { X , Y } i = 1 N X T , Y T I r e f X T , Y T ; Φ i , P t r u e I m o d X T , Y T ; Φ i , P k 2 ( I r e f X T , Y T ; Φ i , P t r u e ) 2 = M i n
Here, I r e f X T , Y T ; Φ i , P t r u e is the reference-type 2D noisy IP frame for the sample rotation angle Φ i . I m o d X T , Y T | Φ i , P k is the modeling 2D IP frame for Φ i ; the current fitting-vectors P k ={ ν k ,     z o , k ,   F k } of the displacement function f C t p d r r 0 , r 0 = (0, 0, z0) is the defect position in a sample, z0 = T/2, integer k is the current iteration number, k = 1, 2, 3, …, K, K is the cycle termination number. The function f C t p d r r 0  are determined by the vector  P t r u e = { 1.5 ,   0.5 ,   1.8 } in the units of the extinction length Λ/π.
To control fitting the χ2-target function, F P k , one introduces the fitting FOM parameter, k defined as
k = i X T , Y T I r e f X T , Y T ; Φ i , P t r u e 1 2 I m o d X T , Y T ; Φ i , P k 1 2 / Σ i Σ X T , Y T I r e f X T , Y T ; Φ i , P t r u e 1 / 2
Using the semi-kinematical diffraction optics approach [9] to model the functions I r e f X T , Y T | Φ i , P t r u e , and   I m o d   X T , Y T |   Φ i , P k , one has launched fitting the χ2-target F P according to the procedure (2), which aims to recover the Coulomb-type point-defect function f C t p d r r 0 . The sample Si(111) is the rectangular prism in the coordinates (X, Y, Z) nominated in the units of Λ/π, 0 ≤ Z ≤ π, −π ≤ X(T) ≤ π, −π≤ Y(T) ≤ π, T = π . Total grid crystal sizes along the dimensionless coordinates (X, Y, Z) are 61 × 61 × 21. The case of the Poisson-noise with levels of 1% and 3% has been taken into consideration. For processing the χ2-target function F P k for simulating the 2D Poisson-noise IP data frames, one has employed the Poisson random value generator [16].

2. The Recovery Issue in the XRDMT Results

2.1. Semi-Kinematical Diffraction Optics Approach

We begin a computer-aided recovery of the displacement field function (1) using the semi-kinematical diffraction optics approach (cf. [9]). As explained in [4,9], the theoretical approach is valid for describing the 2D frame area directly linked to the nearby vicinity area of the crystal-lattice defect. As was shown in [9], the semi-kinematic approach describes diffraction scattering of X-rays by a Coulomb-type point defect as a purely phase object in a thin crystal. This allows us to provide visualization of the defect in the 2D-IP region, which corresponds to the so-called direct defect contrast [4].
In proceeding with the χ2-target function F P k , one applies a joint quasi-Newton–Levenberg–Marquardt–simulated annealing (NLMSA) algorithm (cf. in [9,17,18,19] for details). In this case, the lateral sizes of the calculated 2D IP frames are 61 × 61 grid pixels.
In the previous work [10], the calculations of the 2D IP frames, the Poisson-noise levels of 2% and 4%, and the sample rotation angle range Φ = {−20°, 20°}, have been performed and analyzed. Here, as an illustration, one presents and analyzes the simulated results for the 2D IP frames at the Poisson-noise levels of 1% and 3%.
In Figure 2, there are the 2D IP frames calculated using the semi-kinematical approach of the X-ray diffraction optics theory.
For recovering the displacement field function (1) in accordance with processing the χ2-target function F P k (2), the 2D Poisson-noise IP frames with noise levels of 1% and 3% have been employed, which were calculated in the semi-kinematical approach of the diffraction optics.
The corresponding results for retrieving the reference vector  P (true) of the point defect displacement function (1) in dependence of the 2D Poisson-noise IP frame quantity are listed in Table 1.
Lucky trials are assumed to have FOM values K less than 0.1.
Lucky trials, the last column, are assumed to have the FOM values K less than 0.1.
Analyzing the datasets in Table 1, one can see a clear tendency when the 2D Poisson-noise IP frame quantity increases, from the number 3 to 31, the corresponding FOM K -values decrease, i.e., it does mean the quality of lucky trials is improved. This allows us to conclude that the recovery strategy of further increasing of quantity of the 2D Poisson-noise IP frames would inevitably enhance the digital accuracy of recovering the reference P (true).

2.2. The Diffraction Optics Rigorous Approach, the Takagi–Taupin Equations in the Finite Differences

In the differential form, the canonic Takagi–Taupin takes the form (cf. [20,21])
S ^ s 0 , s h E s 0 , s h = M ^ E s 0 , s h , S ^ = s 0 0 0 s h ,   M ^ = i π λ χ 0 C χ h ̄ exp i f r C χ h exp i f r χ 0
where (s0, sh) is the oblique-coordinate system,   s 0 , h   = sin θ B x + cos θ B z .
The boundary conditions for the wave field electric vector E s 0 , s h take the form
E x , z z = 0 = exp i π α λ sin θ B x 0
Here above, the deviation parameter α = (2k h + h2)/2k2 = –sin(2θBθB is a measure of the angular deviation ΔθB of an incident X-ray monochromatic plane-wave from the exact Bragg angle θB. Coefficient χ0 is the zero-Fourier- and χh,   χ h ¯ are the h-, –h-Fourier components of electric susceptibility χ(r) for a perfect crystal. In our case, the scalar function f(r) is the point defect displacement field function f C t p d r r 0 defined by Equation (1).
Recently in [15], a numerical solution of the boundary-valued Cauchy problem (4)–(5) with the point defect displacement field function (1) has been built up for the sample rotation angle Φ = 0° using the Takagi–Taupin equations in the finite differences. The important thing is that the numerical solutions of the boundary-valued Cauchy problem (4)–(5) with a controlled accuracy of 10−4 have been obtained and digitally controlled by the criterion for thin (non-absorbing) crystal Si(111)
I 0 ( s 0 ,   s h ) s 0 + I h ( s 0 ,   s h ) s h = 0
where I0(s0,sh) and Ih(s0,sh) are the transmitted and diffracted intensities at the current point s0,sh.
In the case of using the semi-kinematic theory approach, the Levenberg-Marquardt algorithm was used to solve the problem in combination with the simulated annealing method (qNLMSA) [9]. Such a combination of the above methods allows the program to overcome local minima and increases the robustness of the optimization (advantages), but at the expense of increasing the total number of iterative steps (disadvantage).
A certain limitation for using the qNLMSA method is the number of pixels used in the 2D IP formation, since the size of the arrays (the first derivative Jacobian matrices and the second derivative Hessian matrices) can complicate and/or disrupt the qNLMSA program. In our case, when the image is constructed as 2D frames with sizes of 182 × 182 pixels, other methods that do not use finite-difference derivative matrices should be chosen. In our study, the highly robust Nelder–Mead (N-M) polyhedron method was applied [22].
As an example, the 2D noise-free IP frame calculated along with the numerical solution of the boundary-valued Cauchy problem (4)–(5) is shown in Figure 3, top left in the linear pixel size units; the linear pixel size is 0.4 μm; the total image size is 182 × 182. Appropriately, going back to our work, the 2D Poisson-noise IP frames with a noise level of 5% have been simulated, see Figure 3, top left, using the Poisson random value generator [14] many times, namely: n = {1, 102, 104}, see, e.g., the 2D Poisson-noise IP frame in Figure 3 bottom left for n = 1.
Afterward, the obtained 2D Poisson-noise IP frames were denoised according to the statistical average method [9]. At the final stage, post-processing the χ2-target function P K, aiming to recover the reference vector  P (true), we employed the Nelder–Mead (N-M) algorithm [22]. The values of the start vector P (start) were randomly chosen within the 40% range around the reference vector P (true). The flow equation for applying the (N-M) algorithm is derived in Appendix A, and some details of the computer (N-M) algorithm script are given in Appendix B.
The post-processing results for recovering the reference vector P (true) of the point defect displacement field function (1) for the sample rotation angle Φ = 0° are listed in Table 2.
As is seen from the dataset in Table 2, there is a stable tendency to decrease the FOM K  with increasing the statistically average 2D IP frame number. Hence, one may claim the statistical average procedure [9] applied to the 2D Poisson-noise IP frames allows us to enhance the accuracy of recovering the point defect displacement field function f C t p d r r 0 by improving the signal-to-noise ratio in the computer-aided XRDMT.

3. Discussion

In the present exploration, based on the Poisson-noise statistical properties, there was an aim to exploit them and, if possible, to solve the inverse Radon problem of the XRDMT diagnostics in the case of the Coulomb-type point defect displacement field function f C t p d r r 0 . The latter is characterized by the three-parameter reference vector P (true). For the first time, in the case of the 2D Poisson-noise IP frames-entire area imaging (see Figure 3), higher digital accuracy recovery of the point defect structure f C t p d r r 0 has been achieved by applying the statistical average method [9]. By using the (N-M) algorithm [22], recovering the Coulomb-type point defect structure has been performed.
It is worth emphasizing that, in contrast to using the semi-kinematic theory approach, in manipulating the 2D entire imaging of the Coulomb-type point defect in a crystal Si(111), one has used the robust Nelder–Mead (N-M) polyhedron method, which allows us to avoid the problems of using the qNLMSA algorithm in processing the χ2-target function F P k optimization. The conducted research allows us to claim that, as large as possible, the number of 2D IP frames recorded with a noise counting level of up to 5% secures the digital-accuracy information and decreases the FOM  K  with increasing the 2D IP frames to be statistically averaged (see Table 2).
Here, it is appropriate to emphasize that the key point in this study, which made it possible to improve the digital accuracy of solving the inverse Radon problem in the scope of the XRDMT technology, is the noise-filtering method of the direct statistical averaging of the 2D Poisson-noise entire area imaging frames proposed (see [9] for details).
As to collecting a large number of the 2D IP frames for employing (switching on) the statistical average procedure [9], it is worth keeping in mind that the 2D IP frame registration rate by the 2D CCD hybrid pixel detector has to be high enough. The latter can be altered within a wide range from one kHz to tens of MHz, controlled by the X-ray intensity value per detector pixel. Supposing the exposure X-ray time is about 0.1 sec per one 2D IP frame, one may design one hundred of the 2D IP frames, at least if each pixel catches 103 photons/sec in the functional pattern part of the 2D IP frames to be collected.
It is interesting that beyond recovering the crystal-lattice defects, the 2D IP frame-by-frame processing allows us to unveil the radiation crystal atomic structure damage by comparing the 2D IP frames one after another and then matching them at the detector registration panel by applying the DATCMP program [23].

4. Conclusions

In this paper, the goal of our study is to unveil a good XRDMT method for purposes of the digital characterization of the crystal-lattice defect structures. The key point of the XRDMT is the fact that it provides a robust, unambiguous procedure to solve a crystal-lattice defect structure with digital accuracy. The test above completes our previous studies in the field of recovering the nanoscale defect structure in crystals.
In contrast to the work [9], the main advance of the present study is the (N-M) algorithm [22] applied for processing the χ2- target function F P K has allowed us to solve the inverse Radon problem of the XRDMT en Gros in the case of a set of the 2D Poisson-noise entire area imaging frames recorded.
It is essential for future sequent works that this study carried out in this paper shows the way and opens some opportunities to employing the XRDMT technique as an effective digital tool for exploring the crystal-lattice defect structures, such as various clusters, small dislocation loops, quantum wells, and quantum wires.

Author Contributions

Conceptualization, F.N.C.; data curation, V.V.V.; software, P.V.K.; formal analysis, F.N.C. and P.V.K.; investigation, P.V.K. and V.V.V.; software, V.V.V.; writing—original draft, F.N.C., P.V.K. and V.V.V.; writing—review and editing, F.N.C., P.V.K. and V.V.V.; visualization, P.V.K. and V.V.V.; supervision, F.N.C.; project administration, F.N.C. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Ministry of Science and Higher Education of the Russian Federation within the state assignment FSRC «Crystallography and Photonics» RAS (X-ray diffraction microtomography data analysis).

Data Availability Statement

Data are contained within this article.

Acknowledgments

The authors are deeply indebted to Asadchikov, V.E., and Zolotov, D.A., for fruitful discussions.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

To retrieve the reference vector P (true) via processing of the χ2-target function F P , (2) by the (N-M) algorithm [22], one employs the flow equation as follows:
Do
Assign the starting vector   P k ( s t a r t ) , k = 1 .
Evaluate the differential Δ P N M ( k ) according to the (N-M) algorithm activated, 1 ≤ kK.
Evaluate the FOM value Ɽk (3) for each k.
The (N-M) algorithm is in action until the | F P k + 1 F P k | F P k < 10−10.
Terminate processing the χ2-target function F P K , which becomes less than 10−10 and or the FOM-value K becomes less than 10−6 for k = K]
End Do.
Based on the flow equation, processing to recover the vector P K has been carried out for the 2D no-noised and de-noised IP frames collected. The (N-M) algorithm-program source code has been implemented in Fortran linked with C++ for the difference-scheme diffraction optics approach to solving the Takagi–Taupin equations for revealing the point defect displacement function f C t p d r r 0 as the dll (dynamic link library). The input data program made requires the 2D IP data frames for the sample rotation angles array Φ i ,   i = 1 , , N ; the relative noise level values array to add the Poisson noise to the reference 2D IPs frames, and the starting v e c t o r   a r r a y P 1 . .
In each pixel of the reference 2D IP frames, the Poisson noise has been added using the Devroye algorithm code [15]. In the final stage, this work program yields the vector P to be fitted the best concerning the reference vector P (true).

Appendix B

The Nelder–Mead algorithm [22] application is in the sequential movement and deformation of the simplex around the extremum of the χ2-target function F P K .
Let it be necessary to find the unconditional minimum of the χ2-target function F P K   of the n-variables.
The (N-M) algorithm parameters are the following:
(i)
the reflection parameter α > 0 was selected as 1.0.
(ii)
the compression factor β > 0 was selected as 0.5.
(iii)
the stretching factor γ > 0 was selected as 2.0.
The following steps in the search are carried out:
  • Preparing step: select (n + 1)-points of vector P i = (pi(1), pi(2), …, pi(n)), i = 1, 2, …, n + 1, to form a simplex of the n-dimensional space. At these vectors, the values of the F P -function are calculated: F 1 = F P 1 , F 2 = F P 2 , …, F n + 1 = F P n + 1 .
  • Sort step: from the simple vertices, one chooses three vectors: P h with the largest of the selected values of the function F h,  P g with the next largest value F g ( P i) and P l with the smallest value of the function F l.
  • Find the gravity center of all the vectors, with the exception of P h: P c= = 1 n i h P i .
  • Reflection step: one reflects the vector P h in relation to xc with the coefficient α and gets the vector P r calculating the function F r = F ( P r). The new vector p-coordinates are calculated using the formula: P r = (1 + α) P c − α P h.
  • Next step: one looks at how much one has managed to reduce the F -function looking F r –value in the rows F h, F g, F l.
    If F r < F l. If the direction is right, one can increase the step, and one can do the “stretching factor” step. The next vector will be P e = (1 − γ) P c + γ P r and F e = F ( P e). If F e < F r, one expands the simplex to this vector: assign P h the value of P e and go to step 9.
    If F r < F e, then one moved too far: assign P h the value of P r and go to step 9.
    If F l < F r < F g, then the choice of a vector is not bad (the new one is better than the previous two). One assigns P h the value of P r and goes to step 9.
    If F g < F r < F h, then swap the values P h and P r. One also needs to swap the values F r and F h, and then one goes to step 6.
    If F h < F r, then, one goes to step 6.
  • Compression step: one chooses the vector P s = β P h + (1 − β) P c and calculates the value F ( P s).
  • If F s < F h, one assigns { P h} as { P s} and goes to step 9.
  • If F s > F h, the initial { P s}-point set was chosen to be the best. One does the “global simplex compression” for the vector with the smallest value P l: P i  P l + ( P i P l)/2, il.
  • Last step: a convergence verification. One estimates the variance of a set of vectors { P } . The aim is to check the mutual vicinity of the simplex vertices that are assumed to be vector P vicinity about the desired value. If the accuracy is not good enough, one continues further processing, beginning from step 2.
In our study, in the case of the crystal-lattice point defect (1), the vector in search  P is the space dimension n equal to 3.

References

  1. Bowen, D.K.; Tanner, B.K. High Resolution X-ray Diffractometry and Topography; Taylor & Francis: New York, NY, USA, 1998. [Google Scholar]
  2. Darowski, N.; Pietsch, U.; Zhuang, Y.; Zerlauth, S.; Bauer, G.; Lübbert, D.; Baumbach, T. In-plane strain and strain relaxation in laterally patterned periodic arrays of Si/SiGe quantum wires and dot arrays. Appl. Phys. Lett. 1998, 73, 806–808. [Google Scholar] [CrossRef]
  3. Pavlov, K.M.; Punegov, V.I. Statistical dynamical theory of X-ray diffraction in the Bragg case: Application to triple-crystal diffractometry. Acta Crystallogr. A 2000, 56, 227–234. [Google Scholar] [CrossRef] [PubMed]
  4. Authier, A. Dynamical Theory of X-ray Diffraction; Oxford University Press: New York, NY, USA, 2001. [Google Scholar]
  5. Benediktovitch, A.; Feranchuk, I.; Ulyanenkov, A. Theoretical Concepts of X-ray Nanoscale Analysis; Springer: Heidelberg, Germany, 2013. [Google Scholar]
  6. Ludwig, W.; Cloetens, P.; Härtwig, J.; Baruchel, J.; Hamelin, B.; Bastie, P. Three-dimensional imaging of crystal defects by ‘topo-tomography. J. Appl. Crystallogr. 2001, 34, 602–607. [Google Scholar] [CrossRef]
  7. Danilewsky, A.N.; Wittge, J.; Croell, A.; Allen, D.; McNally, P.; Vagovič, P.; dos Santos Rolo, T.; Li, Z.; Baumbach, T.; Gorostegui-Colinas, E.; et al. Dislocation dynamics and slip band formation in silicon: In-situ study by X-ray diffraction imaging. J. Crystallogr. Growth 2011, 318, 1157–1163. [Google Scholar] [CrossRef]
  8. Hänschke, D.; Danilewsky, A.; Helfen, L.; Hamann, E.; Baumbach, T. Correlated three-dimensional imaging of dislocations: Insights into the onset of thermal slip in semiconductor wafers. Phys. Rev. Lett. 2017, 119, 215504. [Google Scholar] [CrossRef] [PubMed]
  9. Chukhovskii, F.N.; Konarev, P.V.; Volkov, V.V. Towards a solution of the inverse X-ray diffraction tomography challenge: Theory and iterative algorithm for recovering the 3D displacement field function of Coulomb-type point defects in a crystal. Acta Crystallogr. A 2020, 76, 16–25. [Google Scholar] [CrossRef] [PubMed]
  10. Chukhovskii, F.N.; Konarev, P.V.; Volkov, V.V. Denoising of the Poisson-noise statistics 2D image patterns in the computer X-ray diffraction tomography. Crystals 2023, 13, 561. [Google Scholar] [CrossRef]
  11. Yang, W.; Hong, J.-Y.; Kim, J.-Y.; Paik, S.; Lee, S.H.; Park, J.-S.; Lee, G.; Kim, B.M.; Jung, Y.-J. A novel singular value decomposition- based denoising method in 4-dimensional computed tomography of the brain in stroke patients with statistical evaluation. Sensors 2020, 20, 3063. [Google Scholar] [CrossRef] [PubMed]
  12. Hendriksen, A.A.; Bührer, M.; Leone, L.; Merlini, M.; Vigano, N.; Pelt, D.M.; Marone, F.; di Michiel, M.; Batenburg, K.J. Deep denoising for multi-dimensional synchrotron X-ray tomography without high-quality reference data. Sci. Rep. 2021, 11, 11895. [Google Scholar] [CrossRef] [PubMed]
  13. Liu, N.; Schumacher, T. Improved denoising of structural vibration data employing bilateral filtering. Sensors 2020, 20, 1423. [Google Scholar] [CrossRef] [PubMed]
  14. Hamming, R.W. Numerical Methods for Scientists and Engineers; Mc Graw-Hill: New York, NY, USA, 1961. [Google Scholar]
  15. Grigorev, V.A.; Konarev, P.V.; Chukhovskii, F.N.; Volkov, V.V. X-ray, Synchrotron and Neutron Techniques. J. Surf. Investig. 2023, in press. [Google Scholar]
  16. Devroye, L. The computer generation of Poisson random variables. Computing 1981, 26, 197–207. [Google Scholar] [CrossRef]
  17. Levenberg, K. A Method for the Solution of Certain Non-Linear Problems in Least Squares. Q. Appl. Math. 1944, 2, 164–168. [Google Scholar] [CrossRef]
  18. Marquardt, D. An Algorithm for Least-Squares Estimation of Nonlinear Parameters. SIAM J. Appl. Math. 1963, 11, 431–441. [Google Scholar] [CrossRef]
  19. Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P. Optimization by Simulated Annealing. Science 1983, 220, 671–680. [Google Scholar] [CrossRef] [PubMed]
  20. Takagi, S. Dynamical theory of diffraction applicable to crystals with any kind of small distortion. Acta Crystallogr. 1962, 15, 1311–1312. [Google Scholar] [CrossRef]
  21. Taupin, D. Théorie dynamique dela ladiffraction des rayons X par les cristaux déformés. Bull. Soc. Fr. Miner. 1964, 87, 469–511. [Google Scholar] [CrossRef]
  22. Nelder, J.A.; Mead, R.A. Simplex Method for Function Minimization. Comput. J. 1965, 7, 308–313. [Google Scholar] [CrossRef]
  23. Franke, D.; Kikhney, A.G.; Svergun, D. Automated acquisition and analysis of small angle X-ray scattering data. Nucl. Instrum. Methods Phys. Res. A 2012, 689, 52–59. [Google Scholar] [CrossRef]
Figure 1. Schematic of setup for acquiring the 2D IP data in the frame multimode regime The frameset is for the sample rotation angle Φ to be fixed.
Figure 1. Schematic of setup for acquiring the 2D IP data in the frame multimode regime The frameset is for the sample rotation angle Φ to be fixed.
Crystals 14 00029 g001
Figure 2. The 2D Poisson-noise IP frames were calculated using the semi-kinematical approach. The noise level is 3%. The sample rotation angles Φ are −20° (left), 0° (middle), and 20° (right). The dimensionless coordinates (X, Y) are given in the units of Λ/π.
Figure 2. The 2D Poisson-noise IP frames were calculated using the semi-kinematical approach. The noise level is 3%. The sample rotation angles Φ are −20° (left), 0° (middle), and 20° (right). The dimensionless coordinates (X, Y) are given in the units of Λ/π.
Crystals 14 00029 g002
Figure 3. The 2D no-noise IP frame (top left) and the 2D 5%-Poisson-noise IP frame (bottom left). The denoised * and denoised ** 2D IP frames are assigned for n = 102 top right and n = 104 bottom right, respectively. The sample rotation angle is Φ = 0°. The coordinates (X, Y) are given in linear pixel-size units. The pixel numbers (91,91) correspond to the beginning of the coordinate system (x, y). The linear pixel size is 0.4 μm.
Figure 3. The 2D no-noise IP frame (top left) and the 2D 5%-Poisson-noise IP frame (bottom left). The denoised * and denoised ** 2D IP frames are assigned for n = 102 top right and n = 104 bottom right, respectively. The sample rotation angle is Φ = 0°. The coordinates (X, Y) are given in linear pixel-size units. The pixel numbers (91,91) correspond to the beginning of the coordinate system (x, y). The linear pixel size is 0.4 μm.
Crystals 14 00029 g003
Table 1. Results of recovering the reference vector P (true). The noise levels of the 2D Poisson-noise frames under consideration are given in the first column. The start vectors P (start) have been chosen randomly within 40% around P ( t r u e ) . The sample rotation angle Φ area is lying from −20° to +20°. Depending on the number of sample rotation angles equidistantly lying in the interval {−20° to +20°}, the 2D Poisson-noise IP frame quantity is pointed out in the second column. The retrieved vectors { P K }  are given in the third column.
Table 1. Results of recovering the reference vector P (true). The noise levels of the 2D Poisson-noise frames under consideration are given in the first column. The start vectors P (start) have been chosen randomly within 40% around P ( t r u e ) . The sample rotation angle Φ area is lying from −20° to +20°. Depending on the number of sample rotation angles equidistantly lying in the interval {−20° to +20°}, the 2D Poisson-noise IP frame quantity is pointed out in the second column. The retrieved vectors { P K }  are given in the third column.
%-Noise Level2D IP Frame Quantity P K F P K
× 10 5
K lucky Trials/Total Trials
13(1.46; 0.50; 1.83)1.40.07110/12
111(1.48; 0.50; 1.82)1.20.07010/12
123(1.52; 0.50; 1.81)1.10.06611/12
131(1.49; 0.50; 1.81)0.90.05111/12
33(1.55; 0.50; 1.81)1.70.0979/12
311(1.47; 0.50; 1.81)1.50.0929/12
323(1.52; 0.50; 1.81)1.40.0899/12
331(1.49; 0.50; 1.81)1.10.08410/12
Table 2. Results of the post-processing vector P K. The values of the start vectors P (start) were chosen randomly within the 40% range around the true vector P ( t r u e ) . Lucky trials are assumed to be the FOM K  less than 0.02.
Table 2. Results of the post-processing vector P K. The values of the start vectors P (start) were chosen randomly within the 40% range around the true vector P ( t r u e ) . Lucky trials are assumed to be the FOM K  less than 0.02.
%-NoiseAverage Frames, n P K F P K
× 10 5
K Lucky Trials/
Total Trials
0 1{1.50, 0.50, 1.80}2.21 × 10−76.935 × 10−615/15
51{1.50, 0.50, 1.80}1.42 × 10−11.408 × 10−212/15
5102{1.50, 0.50, 1.80}4.67 × 10−22.307 × 10−312/15
5104{1.50, 0.50, 1.80}7.25 × 10−41.082 × 10−313/15
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Chukhovskii, F.N.; Konarev, P.V.; Volkov, V.V. Comprehensive Recovery of Point Defect Displacement Field Function in Crystals by Computer X-ray Diffraction Microtomography. Crystals 2024, 14, 29. https://doi.org/10.3390/cryst14010029

AMA Style

Chukhovskii FN, Konarev PV, Volkov VV. Comprehensive Recovery of Point Defect Displacement Field Function in Crystals by Computer X-ray Diffraction Microtomography. Crystals. 2024; 14(1):29. https://doi.org/10.3390/cryst14010029

Chicago/Turabian Style

Chukhovskii, Felix N., Petr V. Konarev, and Vladimir V. Volkov. 2024. "Comprehensive Recovery of Point Defect Displacement Field Function in Crystals by Computer X-ray Diffraction Microtomography" Crystals 14, no. 1: 29. https://doi.org/10.3390/cryst14010029

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop