Abstract

Recently, graph convolutional network (GCN) has received more and more interest in the field of hyperspectral image classification (HSIC). The existing GCN-based models for HSIC propagate and aggregate information through the GCN network based on the graph, which is constructed according to spatial location or spectral similarity. However, the constructed graph may not be ideal for the downstream classification task due to the variety of spectral characteristics. In this paper, a fully connected graph is adaptively constructed to make full use of local spatial information and global spectral information. Besides, we apply a neural sparsification technique to remove potentially task-irrelevant edges in case of misleading message propagation. Furthermore, label propagation (LP) serves as regularization to assist the graph network in learning proper edge weights that lead to improved classification performance. The resulting network is end-to-end trainable. The experimental results on three popular benchmarks, including Indian Pines, Pavia University, and Kennedy Space Center, demonstrate the superiority of our algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call