The nascent graph representation learning has shown superiority for resolving graph data. Compared to conventional convolutional neural networks, graph-based deep learning has the advantages of illustrating class boundaries and modeling feature relationships. Faced with hyperspectral image (HSI) classification, the priority problem might be how to convert hyperspectral data into irregular domains from regular grids. In this regard, we present a novel method that performs the localized graph convolutional filtering on HSIs based on spectral graph theory. First, we conducted principal component analysis (PCA) preprocessing to create localized hyperspectral data cubes with unsupervised feature reduction. These feature cubes combined with localized adjacent matrices were fed into the popular graph convolution network in a standard supervised learning paradigm. Finally, we succeeded in analyzing diversified land covers by considering local graph structure with graph convolutional filtering. Experiments on real hyperspectral datasets demonstrated that the presented method offers promising classification performance compared with other popular competitors.
[1]
Joan Bruna,et al.
Spectral Networks and Locally Connected Networks on Graphs
,
2013,
ICLR.
[2]
Xavier Bresson,et al.
Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
,
2016,
NIPS.
[3]
P. Vandergheynst,et al.
Accelerated filtering on graphs using Lanczos method
,
2015,
1509.04537.
[4]
Antonio J. Plaza,et al.
Subspace-Based Support Vector Machines for Hyperspectral Image Classification
,
2015,
IEEE Geoscience and Remote Sensing Letters.
[5]
Seokjun Seo,et al.
Hybrid Approach of Relation Network and Localized Graph Convolutional Filtering for Breast Cancer Subtype Classification
,
2017,
IJCAI.
[6]
Razvan Pascanu,et al.
Relational inductive biases, deep learning, and graph networks
,
2018,
ArXiv.