Open AccessDissertation
Full-field X-ray orientation imaging using convex optimization and a discrete representation of six-dimensional position - orientation space
Nicola Viganò
- 02 Nov 2015
TL;DR: In this paper, the reconstruction problem is formulated as a global minimisation prob- lem, where the reconstruction of a single grain is the solution that minimizes a functional, and all the functionals used include a data fidelity term which ensures that the reconstruction is consistent with the measured diffraction data, and then an additional regularization term is added, like the l 1-norm minimization of the solution vector, that tries to limit the number of orientations per real-space voxel, or a Total Variation operator over the sum of the orientation part of the
read more
Abstract: This Ph.D. thesis is about the development and formalization of a six-dimensional tomography method, for the reconstruction of local orientation in poly-crystalline materials. This method is based on a technique known as diffraction contract tomography (DCT), mainly used in synchrotrons, with a monochromatic and parallel high energy X-ray beam. DCT exists since over a decade now, but it was always employed to analyze undeformed or nearly undeformed materials, described by “grains” with a certain average orientation. Because an orientation can be parametrized by the used of only three num- bers, the local orientation in the grains is modelled by a six-dimensional space X6 = R3 ⊗ O3, that is the outer product between a three-dimensional real- space and another three-dimensional orientation-space. This means that for each point of the real-space, there could be a full three-dimensional orientation- space, which however in practice is restricted to a smaller region of interest called “local orientation-space”. The reconstruction problem is then formulated as a global minimisation prob- lem, where the reconstruction of a single grain is the solution that minimizes a functional. There can be different choices for the functionals to use, and they depend on the type of reconstructions one is looking for, and on the type of a priori knowledge is available. All the functionals used include a data fidelity term which ensures that the reconstruction is consistent with the measured diffraction data, and then an additional regularization term is added, like the l1-norm minimization of the solution vector, that tries to limit the number of orientations per real-space voxel, or a Total Variation operator over the sum of the orientation part of the six-dimensional voxels, in order to enforce the homogeneity of the grain volume. When first published, the results on synthetic data from the third chapter high- lighted some key features of the proposed framework, and showed that it was in principle possible to extend DCT to the reconstruction of moderately de- formed materials, but it was unclear whether it could work in practice. The following chapters instead confirm that the proposed framework is viable for reconstructing moderately deformed materials, and that in conjunction with other techniques, it could also overcome the limitations imposed by the grain indexing, and be applied to more challenging textured materials.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Challenges related to tomographic reconstruction of 3D intragranular orientation fields in the presence of orientation relationships
Z. S. Liu,Nicola Viganò,Wolfgang Ludwig +2 more
- 01 Jul 2022
TL;DR: In this article , a joint, tomographic reconstruction of twin related domains (TRD) and cost function weights was proposed to improve the grain reconstruction quality in X-ray diffraction contrast tomography (DCT).
References
Atomic Decomposition by Basis Pursuit
TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
11.3K
•Book
Principles of Computerized Tomographic Imaging
Avinash C. Kak,Malcolm Slaney,Ge Wang +2 more
- 01 Jan 1987
TL;DR: Properties of Computerized Tomographic Imaging provides a tutorial overview of topics in tomographic imaging covering mathematical principles and theory and how to apply the theory to problems in medical imaging and other fields.
6.5K
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Antonin Chambolle,Thomas Pock +1 more
TL;DR: A first-order primal-dual algorithm for non-smooth convex optimization problems with known saddle-point structure can achieve O(1/N2) convergence on problems, where the primal or the dual objective is uniformly convex, and it can show linear convergence, i.e. O(ωN) for some ω∈(0,1), on smooth problems.
Sparsity and incoherence in compressive sampling
TL;DR: It is shown that ‘1 minimization recovers x 0 exactly when the number of measurements exceeds m Const ·µ 2 (U) ·S · logn, where S is the numberof nonzero components in x 0, and µ is the largest entry in U properly normalized: µ(U) = p n · maxk,j |Uk,j|.
2.4K
Performance improvements for iterative electron tomography reconstruction using graphics processing units (GPUs)
TL;DR: It is demonstrated that by making alternative design decisions in the GPU implementation, an additional speedup can be obtained, again of an order of magnitude, by carefully considering memory access locality when dividing the workload among blocks of threads, the GPU's cache is used more efficiently, making more effective use of the available memory bandwidth.
402