论文标题
改进家长谷物重建的变体图方法
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.
