This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Open AccessArticle
Using Nearest-Neighbor Distributions to Quantify Machine Learning of Materials’ Microstructures
by
Jeffrey M. Rickman
Jeffrey M. Rickman 1,2,*,
Katayun Barmak
Katayun Barmak 3
,
Matthew J. Patrick
Matthew J. Patrick 3
and
Godfred Adomako Mensah
Godfred Adomako Mensah 2
1
Department of Physics, Lehigh University, Bethlehem, PA 18015, USA
2
Department of Materials Science and Engineering, Lehigh University, Bethlehem, PA 18015, USA
3
Department of Applied Physics and Applied Mathematics, Columbia University, New York, NY 10027, USA
*
Author to whom correspondence should be addressed.
Entropy 2025, 27(5), 536; https://doi.org/10.3390/e27050536 (registering DOI)
Submission received: 2 April 2025
/
Revised: 13 May 2025
/
Accepted: 15 May 2025
/
Published: 17 May 2025
Abstract
Machine learning strategies for the semantic segmentation of materials’ micrographs, such as U-Net, have been employed in recent years to enable the automated identification of grain-boundary networks in polycrystals. For example, most recently, this architecture has allowed researchers to address the long-standing problem of automated image segmentation of thin-film microstructures in bright-field TEM micrographs. Such approaches are typically based on the minimization of a binary cross-entropy loss function that compares constructed images to a ground truth at the pixel level over many epochs. In this work, we quantify the rate at which the underlying microstructural features embodied in the grain-boundary network, as described stereologically, are also learned in this process. In particular, we assess the rate of microstructural learning in terms of the moments of the k-th nearest-neighbor pixel distributions and associated metrics, including a microstructural cross-entropy, that embody the spatial correlations among the pixels through a hierarchy of n-point correlation functions. From the moments of these distributions, we obtain so-called learning functions that highlight the rate at which the important topological features of a grain-boundary network appear. It is found that the salient features of network structure emerge after relatively few epochs, suggesting that grain size, network topology, etc., are learned early (as measured in epochs) during the segmentation process.
Share and Cite
MDPI and ACS Style
Rickman, J.M.; Barmak, K.; Patrick, M.J.; Mensah, G.A.
Using Nearest-Neighbor Distributions to Quantify Machine Learning of Materials’ Microstructures. Entropy 2025, 27, 536.
https://doi.org/10.3390/e27050536
AMA Style
Rickman JM, Barmak K, Patrick MJ, Mensah GA.
Using Nearest-Neighbor Distributions to Quantify Machine Learning of Materials’ Microstructures. Entropy. 2025; 27(5):536.
https://doi.org/10.3390/e27050536
Chicago/Turabian Style
Rickman, Jeffrey M., Katayun Barmak, Matthew J. Patrick, and Godfred Adomako Mensah.
2025. "Using Nearest-Neighbor Distributions to Quantify Machine Learning of Materials’ Microstructures" Entropy 27, no. 5: 536.
https://doi.org/10.3390/e27050536
APA Style
Rickman, J. M., Barmak, K., Patrick, M. J., & Mensah, G. A.
(2025). Using Nearest-Neighbor Distributions to Quantify Machine Learning of Materials’ Microstructures. Entropy, 27(5), 536.
https://doi.org/10.3390/e27050536
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details
here.
Article Metrics
Article Access Statistics
For more information on the journal statistics, click
here.
Multiple requests from the same IP address are counted as one view.