Adaptive Sampling Toward a Dynamic Graph Convolutional Network for Hyperspectral Image Classification

Abstract

Graph convolutional networks (GCNs) have been shown to be effective for hyperspectral image (HSI) classification due to their capacity to learn representations of spatial–spectral features. However, the existing GCN-based models heavily rely on predefined receptive fields to capture and aggregate neighbor information for each node, which limits the ability to adaptively selecting the most significant receptive field from graph data. To address the aforementioned problem, in this article, we propose a novel dynamic adaptive sampling GCN (DAS-GCN) algorithm that captures neighbor information through adaptive sampling to allow the receptive field to be dynamically obtained. The basic underlying idea is that the most meaningful receptive field for each target node can be adaptively discovered, and the edge adjacency weights can be adjusted simultaneously after each adaptive sampling operation. Thus, we enable the graph to be dynamically updated and refined. Specifically, the adaptive sampling operation consists of two complementary components; in the first step, the importance of different remote nodes in a large-scale neighborhood is learned, while in the second step, rich underlying spatial–spectral information is extracted from local neighbors and filtered. The proposed model has the ability to learn how to extensively exploit spectral–spatial correlations from both local and remote nodes. Moreover, the proposed DAS-GCN model has a superior ability to leverage node feature information to naturally generalize and efficiently generate node embeddings for unseen data. The experimental results with overall accuracy on four real HSI datasets, i.e., Indian Pines, Pavia university, Houston 2013, and Salinas are 95.63%, 96.40%, 94.70%, and 99.08%, respectively, which clearly demonstrate the advantages of the proposed method compared with other state-of-the-art approaches.