Class-Imbalanced Graph Convolution Smoothing for Hyperspectral Image Classification
Yun Ding, Yanwen Chong, Shaoming Pan, Chun-Hou Zheng
Abstract
Graph convolutional networks (GCNs)-based methods for hyperspectral image (HSI) classification have received more attention due to its flexibility in information aggregation. However, most existing GCN-based methods in HSI community rely on capturing fixed K-hops neighbors for feature information aggregation, which ignores the inherent imbalance in class distributions and fails to achieve optimal feature smoothing through graph convolution operator. It is unreasonable to apply fixed K-hops strategy for feature smoothing in imbalanced classes, as class regions with rich contextual information and those with poor contextual information require to capture different hops neighbors to achieve the optimal feature smoothing. To address this issue, this article proposes a novel approach called class-imbalanced graph convolution smoothing (CIGCS) for HSI classification, which achieves adaptive feature smoothing for imbalanced class regions. Firstly, we construct a semantic block-diagonal graph structure that describes imbalanced semantic class regions by considering label connectivity and spectral Laplacian regularizer. Secondly, we develop the class-imbalanced graph convolution smoothing technique to adaptively aggregate neighbor information for imbalanced class regions based on the decreasing Euclidean distance of samples within each bock-diagonal structure from the perspective of over-smoothing. The choice of adaptive neighbors can be guaranteed by a theoretical upper bound. Finally, the obtained optimal smoothed features are fed into the logistic regression to achieve good classification results. The proposed CIGCS method is evaluated on three real HSI data sets to demonstrate its superiority compared to some popular GCN-based methods.