Publication | Closed Access
<title>K-means reclustering: algorithmic options with quantifiable performance comparisons</title>
20
Citations
0
References
2003
Year
Cluster ComputingEngineeringAnalysis Of AlgorithmUnsupervised Machine LearningImage AnalysisData ScienceData MiningPattern RecognitionComputational GeometryConvergence RatesDocument ClusteringK-means Re-clustering AlgorithmClustering (Nuclear Physics)Knowledge DiscoveryComputer ScienceHyperspectral ImagingComputational ScienceNatural SciencesSegmentation QualityRemote SensingClustering (Data Mining)Fuzzy ClusteringImage SegmentationK-means Reclustering
This paper presents various architectural options for implementing a K-Means Re-Clustering algorithm suitable for unsupervised segmentation of hyperspectral images. Performance metrics are developed based upon quantitative comparisons of convergence rates and segmentation quality. A methodology for making these comparisons is developed and used to establish K values that produce the best segmentations with minimal processing requirements. Convergence rates depend on the initial choice of cluster centers. Consequently, this same methodology may be used to evaluate the effectiveness of different initialization techniques.