6 February 2012 Sampling and clustering algorithm for determining the number of clusters based on the rosette pattern
Author Affiliations +
Abstract
Clustering is one of the image-processing methods used in non-destructive testing (NDT). As one of the initializing parameters, most clustering algorithms, like fuzzy C means (FCM), Iterative self-organization data analysis (ISODATA), K-means, and their derivatives, require the number of clusters. This paper proposes an algorithm for clustering the pixels in C-scan images without any initializing parameters. In this state-of-the-art method, an image is sampled based on the rosette pattern and according to the pattern characteristics, and extracted samples are clustered and then the number of clusters is determined. The centroids of the classes are computed by means of a method used to calculate the distribution function. Based on different data sets, the results show that the algorithm improves the clustering capability by 92.93% and 91.93% in comparison with FCM and K-means algorithms, respectively. Moreover, when dealing with high-resolution data sets, the efficiency of the algorithm in terms of cluster detection and run time improves considerably.
© 2012 Society of Photo-Optical Instrumentation Engineers (SPIE)
Ali Sadr, Amirkeyvan Momtaz, "Sampling and clustering algorithm for determining the number of clusters based on the rosette pattern," Optical Engineering 51(1), 017204 (6 February 2012). https://doi.org/10.1117/1.OE.51.1.017204 . Submission:
JOURNAL ARTICLE
16 PAGES


SHARE
Back to Top