A fuzzy spectral clustering algorithm for hyperspectral image classification

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 hyperspe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IET Image Processing 2021-10, Vol.15 (12), p.2810-2817
Hauptverfasser: Li, Kang, Xu, Jindong, Zhao, Tianyu, Liu, Zhaowei
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1751-9659
1751-9667
DOI:10.1049/ipr2.12266