Self-supervised spectral clustering with spectral embedding for hyperspectral image classification

Spectral clustering, as an algorithm based on graph theory and spectral theory, has shown excellent performance in the classification tasks of hyperspectral images in recent years. Although better results have been achieved, some challenges still exist. The inclusion of a priori information can increase the performance of spectral clustering algorithms; however, in practice, it is often unable to meet the demand for a priori information; at the same time, spectral clustering for the quality of the similarity matrix is demanding, and some of the current algorithms are to improve the similarity matrix from the aspect of data planning, and ultimately for the label feature matrices are diluted. In response to the above problems, this paper proposes a self-supervised spectral clustering with spectral embedding (SESSC). The algorithm obtains a low-dimensional representation of the data through spectral embedding, which can simplify clustering while preserving feature information; then uses the similarity matrix about the data and the guidance of the sample constraint information to obtain a new similarity matrix in order to further refine the structural graph, and the result can feed back and optimize the label feature matrix and the low-dimensional representation of the data. Additionally, we introduce a fractional theory in the update of the sample variable matrix, which assures the integrity and validity of the information in the update. Experimental results show that the proposed algorithm has better performance in hyperspectral image classification than existing spectral clustering algorithms.