Stroud Ryan S, Al-Saffar Ayham, Carter Megan, Moody Michael P, Pedrazzini Stella, Wenman Mark R
Department of Materials and Centre for Nuclear Engineering, Imperial College London, Exhibition Road, London, SW7 2AZ, UK.
Department of Materials, University of Oxford, Parks Road, Oxford, OX1 3PH, UK.
Microsc Microanal. 2024 Nov 4;30(5):853-865. doi: 10.1093/mam/ozae076.
Atom probe tomography (APT) is commonly used to study solute clustering and precipitation in materials. However, standard techniques used to identify and characterize clusters within atom probe data, such as the density-based spatial clustering applications with noise (DBSCAN), often underperform with respect to small clusters. This is a limitation of density-based cluster identification algorithms, due to their dependence on the parameter Nmin, an arbitrary lower limit placed on detectable cluster sizes. Therefore, this article attempts to consider the characterization of clustering in atom probe data as an outlier detection problem of which k-nearest neighbors local outlier factor and learnable unified neighborhood-based anomaly ranking algorithms were tested against a simulated dataset and compared to the standard method. The decision score output of the algorithms was then auto thresholded by the Karcher mean to remove human bias. Each of the major models tested outperforms DBSCAN for cluster sizes of <25 atoms but underperforms for sizes >30 atoms using simulated data. However, the new combined k-nearest neighbors (k-NN) and DBSCAN method presented was able to perform well at all cluster sizes. The combined k-NN and seven methods are presented as a new approach to identifying clusters in APT.
原子探针层析成像(APT)常用于研究材料中的溶质聚集和沉淀。然而,用于识别和表征原子探针数据中团簇的标准技术,如基于密度的带噪声空间聚类应用(DBSCAN),在处理小团簇时往往表现不佳。这是基于密度的团簇识别算法的一个局限性,因为它们依赖于参数Nmin,这是对可检测团簇大小设定的一个任意下限。因此,本文试图将原子探针数据中的聚类表征视为一个异常值检测问题,其中k近邻局部异常因子和基于可学习统一邻域的异常排名算法在一个模拟数据集上进行了测试,并与标准方法进行了比较。然后通过卡尔彻均值对算法的决策分数输出进行自动阈值处理,以消除人为偏差。使用模拟数据进行测试时,每个主要模型在团簇大小小于25个原子时的表现均优于DBSCAN,但在团簇大小大于30个原子时表现较差。然而,提出的新的k近邻(k-NN)和DBSCAN组合方法在所有团簇大小下都能表现良好。k-NN与七种方法的组合被作为一种识别APT中团簇的新方法提出。