Grain segmentation in atomistic simulations using orientation-based iterative self-organizing data analysis

• URL: http://arxiv.org/abs/2112.03348v1
• Date: Mon, 6 Dec 2021 20:44:39 GMT
• Title: Grain segmentation in atomistic simulations using orientation-based iterative self-organizing data analysis
• Authors: M. Vimal and S. Sandfeld and A. Prakash
• Abstract summary: We propose a method for grain segmentation of an atomistic configuration using an unsupervised machine learning algorithm. The proposed method, called the Orisodata algorithm, is based on the iterative self-organizing data analysis technique and is modified to work in the orientation space. The results show that the Orisodata algorithm is able to correctly identify deformation twins as well as regions separated by low angle grain boundaries.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Atomistic simulations have now established themselves as an indispensable tool in understanding deformation mechanisms of materials at the atomic scale. Large scale simulations are regularly used to study the behavior of polycrystalline materials at the nanoscale. In this work, we propose a method for grain segmentation of an atomistic configuration using an unsupervised machine learning algorithm that clusters atoms into individual grains based on their orientation. The proposed method, called the Orisodata algorithm, is based on the iterative self-organizing data analysis technique and is modified to work in the orientation space. The working of the algorithm is demonstrated on a 122 grain nanocrystalline thin film sample in both undeformed and deformed states. The Orisodata algorithm is also compared with two other grain segmentation algorithms available in the open-source visualization tool Ovito. The results show that the Orisodata algorithm is able to correctly identify deformation twins as well as regions separated by low angle grain boundaries. The model parameters have intuitive physical meaning and relate to similar thresholds used in experiments, which not only helps obtain optimal values but also facilitates easy interpretation and validation of results.

Related papers

• Machine Learning for Identifying Grain Boundaries in Scanning Electron Microscopy (SEM) Images of Nanoparticle Superlattices [0.0]
  We present a machine learning workflow for automating grain segmentation in scanning electron microscopy (SEM) images of nanoparticles superlattices. We transform the raw pixel data into explainable numerical representation of superlattice orientations for clustering. This efficiency makes the workflow scalable to large datasets and makes it a valuable tool for integrating data-driven models into decision-making processes.
  arXiv  Detail & Related papers  (2025-01-07T22:51:10Z)
• Stochastic gradient descent estimation of generalized matrix factorization models with application to single-cell RNA sequencing data [41.94295877935867]
  Single-cell RNA sequencing allows the quantitation of gene expression at the individual cell level. Dimensionality reduction is a common preprocessing step to simplify the visualization, clustering, and phenotypic characterization of samples. We present a generalized matrix factorization model assuming a general exponential dispersion family distribution. We propose a scalable adaptive descent algorithm that allows us to estimate the model efficiently.
  arXiv  Detail & Related papers  (2024-12-29T16:02:15Z)
• Application of machine learning in grain-related clustering of Laue spots in a polycrystalline energy dispersive Laue pattern [0.0]
  Grain-corresponding Laue reflections in energy dispersive Laue diffraction experiments are identified using unsupervised machine learning (ML) We employ a combination of clustering algorithms, namely hierarchical clustering (HC) and K-means, to identify grains in a Laue pattern.
  arXiv  Detail & Related papers  (2024-12-16T09:28:17Z)
• Symmetry Nonnegative Matrix Factorization Algorithm Based on Self-paced Learning [10.6600050775306]
  A symmetric nonnegative matrix factorization algorithm was proposed to improve the clustering performance of the model. A weight variable that could measure the degree of difficulty to all samples was assigned in this method. The experimental results showed the effectiveness of the proposed algorithm.
  arXiv  Detail & Related papers  (2024-10-20T06:33:02Z)
• A Machine Learning Based Approach for Statistical Analysis of Detonation Cells from Soot Foils [0.0]
  The proposed algorithm is designed to accurately extract cellular patterns without a training procedure or dataset. The results demonstrated consistent accuracy, with errors remaining within 10%, even in complex cases. This work highlights the broad applicability and potential of the algorithm to advance the understanding of detonation wave dynamics.
  arXiv  Detail & Related papers  (2024-09-10T12:50:46Z)
• Gradient-Based Feature Learning under Structured Data [57.76552698981579]
  In the anisotropic setting, the commonly used spherical gradient dynamics may fail to recover the true direction. We show that appropriate weight normalization that is reminiscent of batch normalization can alleviate this issue. In particular, under the spiked model with a suitably large spike, the sample complexity of gradient-based training can be made independent of the information exponent.
  arXiv  Detail & Related papers  (2023-09-07T16:55:50Z)
• Capturing dynamical correlations using implicit neural representations [85.66456606776552]
  We develop an artificial intelligence framework which combines a neural network trained to mimic simulated data from a model Hamiltonian with automatic differentiation to recover unknown parameters from experimental data. In doing so, we illustrate the ability to build and train a differentiable model only once, which then can be applied in real-time to multi-dimensional scattering data.
  arXiv  Detail & Related papers  (2023-04-08T07:55:36Z)
• Amortized Bayesian Inference of GISAXS Data with Normalizing Flows [0.10752246796855561]
  We propose a simulation-based framework that combines variational auto-encoders and normalizing flows to estimate the posterior distribution of object parameters. We demonstrate that our method reduces the inference cost by orders of magnitude while producing consistent results with ABC.
  arXiv  Detail & Related papers  (2022-10-04T12:09:57Z)
• SHREC 2021: Classification in cryo-electron tomograms [13.443446070180562]
  cryo-electron tomography (cryo-ET) is an imaging technique that allows three-dimensional visualization of macro-molecular assemblies. Cryo-ET comes with a number of challenges, mainly low signal-to-noise and inability to obtain images from all angles. We generate a novel simulated dataset to benchmark different methods of localization and classification of biological macromolecules in tomograms.
  arXiv  Detail & Related papers  (2022-03-18T16:08:22Z)
• Optimal radial basis for density-based atomic representations [58.720142291102135]
  We discuss how to build an adaptive, optimal numerical basis that is chosen to represent most efficiently the structural diversity of the dataset at hand. For each training dataset, this optimal basis is unique, and can be computed at no additional cost with respect to the primitive basis. We demonstrate that this construction yields representations that are accurate and computationally efficient.
  arXiv  Detail & Related papers  (2021-05-18T17:57:08Z)
• Machine Learning for Vibrational Spectroscopy via Divide-and-Conquer Semiclassical Initial Value Representation Molecular Dynamics with Application to N-Methylacetamide [56.515978031364064]
  A machine learning algorithm for partitioning the nuclear vibrational space into subspaces is introduced. The subdivision criterion is based on Liouville's theorem, i.e. best preservation of the unitary of the reduced dimensionality Jacobian determinant. The algorithm is applied to the divide-and-conquer semiclassical calculation of the power spectrum of 12-atom trans-N-Methylacetamide.
  arXiv  Detail & Related papers  (2021-01-11T14:47:33Z)
• Sparse PCA via $l_{2,p}$-Norm Regularization for Unsupervised Feature Selection [138.97647716793333]
  We propose a simple and efficient unsupervised feature selection method, by combining reconstruction error with $l_2,p$-norm regularization. We present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically.
  arXiv  Detail & Related papers  (2020-12-29T04:08:38Z)
• A Novel Granular-Based Bi-Clustering Method of Deep Mining the Co-Expressed Genes [76.84066556597342]
  Bi-clustering methods are used to mine bi-clusters whose subsets of samples (genes) are co-regulated under their test conditions. Unfortunately, traditional bi-clustering methods are not fully effective in discovering such bi-clusters. We propose a novel bi-clustering method by involving here the theory of Granular Computing.
  arXiv  Detail & Related papers  (2020-05-12T02:04:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.