Learning Discriminative Embedding for Hyperspectral Image Clustering Based on Set-to-Set and Sample-to-Sample Distances

Abstract

Recently, deep learning techniques have been introduced to address hyperspectral image (HSI) classification problems and have achieved the state-of-the-art performances. In this article, we propose a novel clustering algorithm for HSI based on learning embedding using the set-to-set and sample-to-sample distances (LSSDs). This technique consists of four main components: 1) oversegmentation; 2) generation of set-to-set and sample-to-sample distances; 3) learning embedding by training a siamese network; and 4) density-based spectral clustering. First, the HSI is oversegmented into superpixels by using the entropy rate superpixel (ERS) algorithm. Second, the set-to-set distances are obtained by representing the segmented sets of samples as affine hull (AH) models, whereas the sample-to-sample distances are computed by employing the local covariance matrix representation (LCMR) method. Third, sample pairs with the smallest and largest similarities are extracted according to the two distances. Then, these pairs are fed into the siamese multilayer perceptron (MLP) network and discriminative embeddings are learned by training the network with contrastive loss. Finally, density-based spectral clustering is applied to the deep embedding to obtain clustering results. Experimental results on three real HSIs demonstrate that the proposed method can achieve better performance than the considered baseline methods.