Recently, graph convolutional network (GCN) has achieved promising results in hyperspectral image (HSI) classification. However, GCN is a transductive learning method, which is difficult to aggregate the new node. Besides, the existing GCN-based methods divide graph construction and graph classification into two stages ignoring the influence of constructed graph error on classification results. Moreover, the available GCN-based methods fail to understand the global and contextual information of the graph. In this article, we propose a novel multiscale graph sample and aggregate network with a context-aware learning method for HSI classification. The proposed network adopts a multiscale graph sample and aggregate network (graphSAGE) to learn the multiscale features from the local regions graph, which improves the diversity of network input information and effectively solves the impact of original input graph errors on classification. By employing a context-aware mechanism to characterize the importance among spatially neighboring regions, deep contextual and global information of the graph can be learned automatically by focusing on important spatial targets. Meanwhile, the graph structure is reconstructed automatically based on the classified objects as network training, which is able to effectively reduce the influence of the initial graph error on the classification result. Extensive experiments are conducted on three real HSI datasets, which are demonstrated to outperform the compared state-of-the-art methods.

The application of graph convolutional networks (GCNs) to hyperspectral image (HSI) classification is a heavily researched topic. However, GCNs are based on spectral filters, which are computationally costly and fail to suppress noise effectively. In addition, the current GCN-based methods are prone to oversmoothing (the representation of each node tends to be congruent) problems. To circumvent these problems, a novel semi-supervised locality-preserving dense graph neural network (GNN) with autoregressive moving average (ARMA) filters and context-aware learning (DARMA-CAL) is proposed for HSI classification. In this work, we introduce the ARMA filter instead of a spectral filter to apply to GNNs. The ARMA filter can better capture the global graph structure and is more robust to noise. More importantly, the ARMA filter can simplify calculations compared with the spectral filter. In addition, we show that the ARMA filter can be approximated by a recursive method. Furthermore, we propose a dense structure, which not only implements the ARMA filter in the structure, but is also locality-preserving. Finally, we design a layerwise context-aware learning mechanism to extract the useful local information generated by each layer of the dense ARMA network. The experimental results on three real HSI datasets show that DARMA-CAL outperforms the compared state-of-the-art methods.

Due to prior knowledge deficiency, large spectral variability, and high dimension of hyperspectral image (HSI), HSI clustering is extremally a fundamental but challenging task. Deep clustering methods have achieved remarkable success and have attracted increasing attention in unsupervised HSI classification (HSIC). However, the poor robustness, adaptability, and feature presentation limit their practical applications to complex large-scale HSI datasets. Thus, this article introduces a novel self-supervised locality preserving low-pass graph convolutional embedding method (L2GCC) for large-scale hyperspectral image clustering. Specifically, a spectral–spatial transformation HSI preprocessing mechanism is introduced to learn superpixel-level spectral–spatial features from HSI and reduce the number of graph nodes for subsequent network processing. In addition, locality preserving low-pass graph convolutional embedding autoencoder is proposed, in which the low-pass graph convolution and layerwise graph attention are designed to extract the smoother features and preserve layerwise locality features, respectively. Finally, we develop a self-training strategy, in which a self-training clustering objective employs soft labels to supervise the clustering process and obtain appropriate hidden representations for node clustering. L2GCC is an end-to-end training network, which is jointly optimized by graph reconstruction loss and self-training clustering loss. On Indian Pines, Salinas, and University of Houston 2013 datasets, the clustering accuracy overall accuracies (OAs) of the proposed L2GCC are 73.51%, 83.15%, and 64.12%, respectively.

Hyperspectral image (HSI) clustering is an extremely fundamental but challenging task with no labeled samples. Deep clustering methods have attracted increasing attention and have achieved remarkable success in HSI classification. However, most existing clustering methods are ineffective for large-scale HSI, due to their poor robustness, adaptability, and feature presentation. In this article, to address these issues, we introduce unsupervised self-correlated learning smoothy enhanced locality preserving graph convolution embedding clustering ( $\text{S}^{2}$ LGCC) for large-scale HSI. Specifically, the spectral-spatial transformation is introduced to transform the original HSI into a graph while preserving the local spectral features and spatial structures. After that, a locality preserving graph convolutional embedding encoder is designed to learn the hidden representation from the graph, in which the deep layer-wise graph convolutional network (LGAT) is proposed to preserve the adaptive layerwise locality features. In addition, the self-correlated learning smoothy module is developed to learn the smoothy information and the nonlocal relationship in the hidden representation space for clustering. Finally, a self-training strategy is proposed to cluster the graph node, in which a self-training clustering objective employs soft labels to supervise the clustering process. The proposed $\text{S}^{2}$ LGCC is jointly optimized by the fusion graph reconstruction loss and self-training clustering loss, and the two benefit each other. On Indian Pines (IP), Salinas, and UH2013 datasets, the overall accuracies (OAs) of our $\text{S}^{2}$ LGCC are 71.76%, 82.61%, and 63.82%, respectively.

Graph convolutional network (GCN) has shown potential in hyperspectral image (HSI) classification. However, GCN is a transductive learning method, which is difficult to aggregate the new node. The available GCN-based methods fail to understand the global and contextual information of the graph. To address this deficiency, a novel semisupervised network based on graph sample and aggregate-attention (SAGE-A) for HSIs’ classification is proposed. Different from the GCN-based method, SAGE-A adopts a multilevel graph sample and aggregate (graphSAGE) network, as it can flexibly aggregate the new neighbor node among arbitrarily structured non-Euclidean data and capture long-range contextual relations. Inspired by the convolution neural network (CNN) self-attention mechanism, the proposed network uses the graph attention mechanism to characterize the importance among spatially neighboring regions, so the deep contextual and global information of the graph can be learned automatically by focusing on important spatial targets. Extensive experimental results on different real hyperspectral data sets demonstrate the performances of our proposed method compared with the state-of-the-art methods.

Graph convolutional networks (GCNs) have begun to show their potential in hyperspectral image (HSI) classification in recent years. However, most of the current GCN methods are designed to learn node features on fixed and homogeneous graphs, and it is difficult for them to learn effective node features on heterogeneous graphs. The limitation is particularly evident in hyperspectral classification because of the different types of nodes and edges. The graph transformer network with the graph attention mechanism (GTN-A) is proposed to address this shortcoming in this letter. It can generate a new graph structure, which is represented by a more useful meta-path, so that node features can be better aggregated. The experiments conducted on two benchmark datasets illustrate the effectiveness of our method.