Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. An Algorithm to Generate Synthetic 3D Microstructures from 2D Exemplars

An Algorithm to Generate Synthetic 3D Microstructures from 2D Exemplars

Thumbnail Image
Download
Name

11837_2019_3825_ReferencePDF.pdf

Size

1.47 MB

Format

Adobe PDF

Checksum (MD5)

742f062529e2102fe2b2f443732f0cff

Download all files submitted through automated deposit
art_5424575251580481907.zip (1.43 MB)
Author(s)
Ashton, Tristan N
•
Guillen, Donna P
•
Harris, William H
Date Issued
October 15, 2019
Publisher
Springer US
Version
Author's final manuscript
Abstract
Abstract The inverse problem of constructing 3D microstructures from 2D data is an area of active research within the materials science community. This paper presents the implementation of a robust, computationally efficient algorithm: the Hierarchical Algorithm for the Reconstruction of Exemplars (HARE), written in Python to reconstruct 3D features in a given microstructure from up to three orthogonal 2D exemplars and using nearest-neighbor matching to reproduce feature qualities, such as shape, size, and distribution. HARE’s feature sampling implements histogram reweighting to avoid both over- and undersampling. A neighborhood voting scheme allows each pixel to provisionally affect its neighbors according to its weight. The algorithm is presently configured for two-phase materials and is being extended to accommodate multiple phases. HARE is a convenient and robust base from which to generate statistically representative synthetic microstructures for use in multi-scale modeling or machine-learning applications to support advanced manufacturing and materials discovery.
MIT Department
Massachusetts Institute of Technology. Department of Materials Science and Engineering
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/131916
DOI of Published Version
https://doi.org/10.1007/s11837-019-03825-w
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.