Optimized and autonomous machine learning framework for characterizing pores, particles, grains and grain boundaries in microstructural images

• URL: http://arxiv.org/abs/2101.06474v1
• Date: Sat, 16 Jan 2021 16:42:19 GMT
• Title: Optimized and autonomous machine learning framework for characterizing pores, particles, grains and grain boundaries in microstructural images
• Abstract summary: Experimental microstructural characterization techniques generate a large amount of data that requires expensive computationally resources. In this work, an optimized machine learning (ML) framework is proposed to autonomously and efficiently characterize pores, particles, grains and grain boundaries (GBs) from a given microstructure image.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Additively manufactured metals exhibit heterogeneous microstructure which dictates their material and failure properties. Experimental microstructural characterization techniques generate a large amount of data that requires expensive computationally resources. In this work, an optimized machine learning (ML) framework is proposed to autonomously and efficiently characterize pores, particles, grains and grain boundaries (GBs) from a given microstructure image. First, using a classifier Convolutional Neural Network (CNN), defects such as pores, powder particles, or GBs were recognized from a given microstructure. Depending on the type of defect, two different processes were used. For powder particles or pores, binary segmentations were generated using an optimized Convolutional Encoder-Decoder Network (CEDN). The binary segmentations were used to used obtain particle and pore size and bounding boxes using an object detection ML network (YOLOv5). For GBs, another optimized CEDN was developed to generate RGB segmentation images, which were used to obtain grain size distribution using two regression CNNS. To optimize the RGB CEDN, the Deep Emulator Network SEarch (DENSE) method which employs the Covariance Matrix Adaptation - Evolution Strategy (CMA-ES) was implemented. The optimized RGB segmentation network showed a substantial reduction in training time and GPU usage compared to the unoptimized network, while maintaining high accuracy. Lastly, the proposed framework showed a significant improvement in analysis time when compared to conventional methods.

Related papers

• Enhancing EBSD throughput of battery electrode materials using super-resolution generative adversarial networks [0.0]
  This work demonstrates a machine learning super-resolution framework using a generative adversarial network (SRGAN) to significantly increase EBSD throughput.<n>The SRGAN model was trained on EBSD data of LiNixMnyCozO2 cathode particles to enhance low-resolution datasets.<n>We demonstrate that a 5x upscaling factor, corresponding to a 25x speed-up in acquisition time or a 25x larger field of view, is practical while maintaining acceptable accuracy in key metrics like grain size and shape.
  arXiv  Detail & Related papers  (2026-08-19T17:14:20Z)
• Square Superpixel Generation and Representation Learning via Granular Ball Computing [97.99956628286243]
  Superpixels provide a compact region-based representation that preserves object boundaries and local structures.<n>Most existing superpixel algorithms produce irregularly shaped regions, which are not well aligned with regular operators such as convolutions.<n>Motivated by the adaptive representation and coverage property of granular-ball computing, we develop a square superpixel generation approach.
  arXiv  Detail & Related papers  (2026-03-31T09:06:58Z)
• Optimization of Precipitate Segmentation Through Linear Genetic Programming of Image Processing [0.051564841003740584]
  Current analysis of additive manufactured niobium-based copper alloys relies on hand annotation due to varying contrast, noise, and image artifacts present in micrographs.<n>We present a filtering and segmentation for detecting precipitates in FIB cross-section micrographs, optimized using linear genetic programming (LGP), which accounts for the various artifacts.
  arXiv  Detail & Related papers  (2026-02-07T01:59:10Z)
• STEM Diffraction Pattern Analysis with Deep Learning Networks [0.0]
  This work presents a machine learning-based approach for predicting Euler angles directly from scanning transmission electron microscopy (STEM) diffraction patterns (DPs)<n>It enables the automated generation of high-resolution crystal orientation maps, facilitating the analysis of internal microstructures at the nanoscale.<n>Three deep learning architectures--convolutional neural networks (CNNs), Dense Convolutional Networks (DenseNets), and Shifted Windows (Swin) Transformers--are evaluated, using an experimentally acquired dataset labelled via a commercial TM algorithm.
  arXiv  Detail & Related papers  (2025-07-02T16:58:09Z)
• CRISP: A Framework for Cryo-EM Image Segmentation and Processing with Conditional Random Field [0.0]
  We present a pipeline that automatically generates high-quality segmentation maps from cryo-EM data. Our modular framework enables the selection of various segmentation models and loss functions. When trained on a limited set of micrographs, our approach achieves over 90% accuracy, recall, precision, Intersection over Union (IoU) and F1-score on synthetic data.
  arXiv  Detail & Related papers  (2025-02-12T10:44:45Z)
• 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)
• Two Sparse Matrices are Better than One: Sparsifying Neural Networks with Double Sparse Factorization [0.0]
  We present Double Sparse Factorization (DSF), where we factorize each weight matrix into two sparse matrices. Our method achieves state-of-the-art results, enabling unprecedented sparsification of neural networks.
  arXiv  Detail & Related papers  (2024-09-27T15:48:39Z)
• Efficient Segmentation with Texture in Ore Images Based on Box-supervised Approach [6.6773975364173]
  A box-supervised technique with texture features is proposed to identify complete and independent ores. The proposed method achieves over 50 frames per second with a small model size of 21.6 MB. The method maintains a high level of accuracy compared with the state-of-the-art approaches on ore image dataset.
  arXiv  Detail & Related papers  (2023-11-10T08:28:22Z)
• Distance Weighted Trans Network for Image Completion [52.318730994423106]
  We propose a new architecture that relies on Distance-based Weighted Transformer (DWT) to better understand the relationships between an image's components. CNNs are used to augment the local texture information of coarse priors. DWT blocks are used to recover certain coarse textures and coherent visual structures.
  arXiv  Detail & Related papers  (2023-10-11T12:46:11Z)
• Compacting Binary Neural Networks by Sparse Kernel Selection [58.84313343190488]
  This paper is motivated by a previously revealed phenomenon that the binary kernels in successful BNNs are nearly power-law distributed. We develop the Permutation Straight-Through Estimator (PSTE) that is able to not only optimize the selection process end-to-end but also maintain the non-repetitive occupancy of selected codewords. Experiments verify that our method reduces both the model size and bit-wise computational costs, and achieves accuracy improvements compared with state-of-the-art BNNs under comparable budgets.
  arXiv  Detail & Related papers  (2023-03-25T13:53:02Z)
• Iterative Soft Shrinkage Learning for Efficient Image Super-Resolution [91.3781512926942]
  Image super-resolution (SR) has witnessed extensive neural network designs from CNN to transformer architectures. This work investigates the potential of network pruning for super-resolution iteration to take advantage of off-the-shelf network designs and reduce the underlying computational overhead. We propose a novel Iterative Soft Shrinkage-Percentage (ISS-P) method by optimizing the sparse structure of a randomly network at each and tweaking unimportant weights with a small amount proportional to the magnitude scale on-the-fly.
  arXiv  Detail & Related papers  (2023-03-16T21:06:13Z)
• Efficient Dataset Distillation Using Random Feature Approximation [109.07737733329019]
  We propose a novel algorithm that uses a random feature approximation (RFA) of the Neural Network Gaussian Process (NNGP) kernel. Our algorithm provides at least a 100-fold speedup over KIP and can run on a single GPU. Our new method, termed an RFA Distillation (RFAD), performs competitively with KIP and other dataset condensation algorithms in accuracy over a range of large-scale datasets.
  arXiv  Detail & Related papers  (2022-10-21T15:56:13Z)
• FluTO: Graded Multiscale Fluid Topology Optimization using Neural Networks [5.104113288544065]
  We propose a graded multiscale topology optimization (GMTO) for designing fluid-flow devices. GMTO significantly reduces the computation while retaining many of the benefits of multi-scale topology optimization (MTO)
  arXiv  Detail & Related papers  (2022-09-16T20:52:21Z)
• Efficient Micro-Structured Weight Unification and Pruning for Neural Network Compression [56.83861738731913]
  Deep Neural Network (DNN) models are essential for practical applications, especially for resource limited devices. Previous unstructured or structured weight pruning methods can hardly truly accelerate inference. We propose a generalized weight unification framework at a hardware compatible micro-structured level to achieve high amount of compression and acceleration.
  arXiv  Detail & Related papers  (2021-06-15T17:22:59Z)
• Random Features for the Neural Tangent Kernel [57.132634274795066]
  We propose an efficient feature map construction of the Neural Tangent Kernel (NTK) of fully-connected ReLU network. We show that dimension of the resulting features is much smaller than other baseline feature map constructions to achieve comparable error bounds both in theory and practice.
  arXiv  Detail & Related papers  (2021-04-03T09:08:12Z)
• Improving the Segmentation of Scanning Probe Microscope Images using Convolutional Neural Networks [0.9236074230806579]
  We develop protocols for the segmentation of images of 2D assemblies of gold nanoparticles formed on silicon surfaces via deposition from an organic solvent. The evaporation of the solvent drives far-from-equilibrium self-organisation of the particles, producing a wide variety of nano- and micro-structured patterns. We show that a segmentation strategy using the U-Net convolutional neural network outperforms traditional automated approaches.
  arXiv  Detail & Related papers  (2020-08-27T20:49:59Z)
• Binarized Graph Neural Network [65.20589262811677]
  We develop a binarized graph neural network to learn the binary representations of the nodes with binary network parameters. Our proposed method can be seamlessly integrated into the existing GNN-based embedding approaches. Experiments indicate that the proposed binarized graph neural network, namely BGN, is orders of magnitude more efficient in terms of both time and space.
  arXiv  Detail & Related papers  (2020-04-19T09:43:14Z)
• Res-CR-Net, a residual network with a novel architecture optimized for the semantic segmentation of microscopy images [0.5363346028859919]
  Res-CR-Net is a type of Deep Neural Network (DNN) that features residual blocks with either a bundle of separable atrous convolutions with different dilation rates or a convolutional LSTM. The number of filters used in each residual block and the number of blocks are the only hyper parameters that need to be modified in order to optimize the network training for a variety of different microscopy images.
  arXiv  Detail & Related papers  (2020-04-14T21:21:01Z)

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.