TL;DR
This paper introduces a nearly-optimal orientation sampling method using quaternion representation to significantly reduce computational costs in diffraction pattern indexing of polycrystalline materials.
Contribution
It develops a quaternion-based sampling technique for orientations, optimizing the distribution on a 4D sphere to improve efficiency in pattern indexing.
Findings
Reduced the number of samples needed for accurate indexing.
Generated orientation sets for all Laue groups and made them publicly available.
Demonstrated robustness of the method in noisy data conditions.
Abstract
Orientation mapping is a widely used technique for revealing the microstructure of a polycrystalline sample. The crystalline orientation at each point in the sample is determined by analysis of the diffraction pattern, a process known as pattern indexing. A recent development in pattern indexing is the use of a brute-force approach, whereby diffraction patterns are simulated for a large number of crystalline orientations, and compared against the experimentally observed diffraction pattern in order to determine the most likely orientation. Whilst this method can robust identify orientations in the presence of noise, it has very high computational requirements. In this article, the computational burden is reduced by developing a method for nearly-optimal sampling of orientations. By using the quaternion representation of orientations, it is shown that the optimal sampling problem is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
