基于变异图的改进母粒重构方法
The variant graph approach to improved parent grain reconstruction
摘要：
变体图是一种新的混合算法，它结合了已建立的全局晶粒图和局部邻居级投票方法的优点，同时减轻了它们的缺点，从部分或完全相变的微结构的取向图中重建父晶粒。变体图算法是通用的，并且能够通过基于共同的父方向变体将子颗粒聚类在一起来从任何父-子组合重构变换微结构。与晶粒图相比，变体图的主要优点是其固有的更准确地检测原始奥氏体晶界的能力。马尔可夫聚类和邻居级投票的方法来重建原奥氏体取向的批判性检查首先进行。在此之后，通过从示例低碳板条马氏体钢微观结构重建原奥氏体晶粒和边界来展示变体图算法的性能。还提出了对特定形态条件下的变体图算法的编程扩展和具有小的相互失向角的变体的合并。变异图算法的重建精度和计算性能与母体颗粒重建的替代方法相当或优于替代方法。变体图算法作为MTEX 5.8中相变分析功能的新添加而实现，可供社区免费下载。
英文摘要：
The variant graph is a new, hybrid algorithm that combines the strengths of established global grain graph and local neighbor level voting approaches, while alleviating their shortcomings, to reconstruct parent grains from orientation maps of partially or fully phase-transformed microstructures. The variant graph algorithm is versatile and is capable of reconstructing transformation microstructures from any parent-child combination by clustering together child grains based on a common parent orientation variant. The main advantage of the variant graph over the grain graph is its inherent ability to more accurately detect prior austenite grain boundaries. A critical examination of Markovian clustering and neighbor level voting as methods to reconstruct prior austenite orientations is first conducted. Following this, the performance of the variant graph algorithm is showcased by reconstructing the prior austenite grains and boundaries from an example low-carbon lath martensite steel microstructure. Programmatic extensions to the variant graph algorithm for specific morphological conditions and the merging of variants with small mutual disorientation angles are also proposed. The accuracy of the reconstruction and the computational performance of the variant graph algorithm is either on-par or outperforms alternate methods for parent grain reconstruction. The variant graph algorithm is implemented as a new addition to the functionalities for phase transformation analysis in MTEX 5.8 and is freely available for download by the community.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
