Diversity-Connected Graph Convolutional Network for Hyperspectral Image Classification
Yun Ding, Yanwen Chong, Shaoming Pan, Chun-Hou Zheng
Abstract
Hyperspectral image classification methods based on the graph convolutional network (GCN) have received more attention because they can handle irregular regions by graph encoding techniques. However, GCN-based HSI classification methods are highly sensitive to the quality of the graph structure. Its performance degrades in the case of underdeveloped graphs because it cannot excavate the intrinsic adjacency relationships. Thus, it is necessary to improve the quality of graph structure in GCN-based methods. In this paper, a novel diversity-connected graph convolutional network (DCGCN) method is proposed to improve the quality of the graph structure for HSI classification, and its basic idea can be adopted by other GCN-based methods. First, the potential neighbors are excavated by performing topological extensions based on the given graph. The diversity of surrounding neighbors is maintained by adaptively smoothing operation via a global threshold value from Kullback-Leibler divergence to eliminate weak interclass connections caused by weakly spectral variability. Second, another key connectivity restriction is imposed on the diverse neighbors to further refine the ambiguous connections of hard samples aiming at removing strong interclass connections where the spectral information is heavily confounded. Finally, the DCGCN method is analyzed theoretically to demonstrate its low-pass filter property. The comprehensive experiments demonstrate the effectiveness of the proposed DCGCN method and the basic idea of the diversity-connected graph in terms of overall accuracy (OA), kappa coefficient (KC), average accuracy (AA) indexes.