Spectral clustering is an unsupervised clustering algorithm, and is widely used in the field of pattern recognition and computer vision due to its good clustering performance. However, the traditional spectral clustering algorithm is not suitable for large-scale data classification, such as hyperspectral remote sensing image, because of its high computational complexity, and it is difficult to characterize the inherent uncertainty of the hyperspectral remote sensing image. This paper uses fuzzy anchors to process hyperspectral image classification and proposes a novel spectral clustering algorithm based on fuzzy similarity measure. The proposed algorithm utilizes the fuzzy similarity measure to obtain the similarity between the data points and the anchors, and then gets the similarity matrix. Finally, spectral clustering is performed on the similarity matrix to compute the classification results. The experimental results on the hyperspectral remote sensing image data sets have demonstrated the effectiveness of the proposed algorithm, and the introduction of fuzzy similarity measure gives rise to a more robust similarity matrix. Compared with existing methods, the proposed algorithm has a better classification result on the hyperspectral remote sensing image, and the kappa coefficient obtained by the proposed algorithm is 2% higher than the traditional algorithms.
INTRODUCTIONWith the development of remote sensing technology, the application of hyperspectral remote sensing image has become more and more extensive. The accurately segmentation ground features through hyperspectral remote sensing image has received widespread attention. Over the past few years, unsupervised learning played an important role in the field of hyperspectral image classification because it did not need labels and did not have the problem of labelling error. As a typical method, spectral clustering algorithm [1] has been widely used in medical image analysis [2, 3], traffic forecasting [4], image segmentation [5][6][7], and other fields [8,9] due to its good performance of multi-morphological spatial clustering and convergence to the global optimal solution. The traditional spectral clustering algorithm, however, focuses on clustering accuracy whereas ignores the underlying computational complexity and memory requirements for constructing the similarity matrix and computing eigenvectors. Therefore, it is dif-This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited.