An Efficient Topology Construction Scheme Designed for Graph Neural Networks in Hyperspectral Image Classification

Hyperpixel-based graph neural networks (GNNs) have achieved remarkable results in hyperspectral image (HSI) classification tasks, mainly due to their ability to capture the implied topology while maintaining low computational complexity by transferring information between spatially neighboring hyperpixels. However, the representation assumption that pixel features within a hyperpixel are treated as identical may limit the expressive power of the model because feature regions in hyperspectral imagery are usually irregular, leading to difficulties in homogeneity of pixels within a hyperpixel and determination of the scale of the hyperpixel. To overcome this problem, we re-understand the implied topology between pixels through their spectral feature similarity and spatial location dependence. Considering the computational bottleneck, we adopt a new subgraph delineation method and sorting and filtering techniques to select important relation pairs from the graph, so as to construct an a priori topology that favors the downstream tasks on HSIs of arbitrary size. Based on this a priori topology, we construct the GCN module to optimize the representation of the pixel features and integrate it into a unified framework.We conducted a series of comprehensive experiments on three benchmark datasets, and the results show that the proposed method has a clear advantage in distinguishing compact, discontinuous, and small- to medium-sized feature regions and even outperforms some of the powerful superpixel-level fusion models proposed in recent years. In addition, we find that different models exhibit different discriminative abilities when dealing with feature regions of different characteristics. In particular, the classification performance is significantly improved by combining these models with our approach. Our code is open-source on the public platform GitHub: https://github.com/LittleBlackBearLiXin/Pixel-level-graph-neural-networks-based-on-optimized-feature-representation-for-hyperspectral-image.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3595997
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Topology Construction Scheme Designed for Graph Neural Networks in Hyperspectral Image Classification

Yaoqun Xu, Yu Zhang, Xin Li
IEEE Access
Face and Expression Recognition
article

An Efficient Topology Construction Scheme Designed for Graph Neural Networks in Hyperspectral Image Classification

Yaoqun Xu, Yu Zhang, Xin Li
article en

Abstract

Hyperpixel-based graph neural networks (GNNs) have achieved remarkable results in hyperspectral image (HSI) classification tasks, mainly due to their ability to capture the implied topology while maintaining low computational complexity by transferring information between spatially neighboring hyperpixels. However, the representation assumption that pixel features within a hyperpixel are treated as identical may limit the expressive power of the model because feature regions in hyperspectral imagery are usually irregular, leading to difficulties in homogeneity of pixels within a hyperpixel and determination of the scale of the hyperpixel. To overcome this problem, we re-understand the implied topology between pixels through their spectral feature similarity and spatial location dependence. Considering the computational bottleneck, we adopt a new subgraph delineation method and sorting and filtering techniques to select important relation pairs from the graph, so as to construct an a priori topology that favors the downstream tasks on HSIs of arbitrary size. Based on this a priori topology, we construct the GCN module to optimize the representation of the pixel features and integrate it into a unified framework.We conducted a series of comprehensive experiments on three benchmark datasets, and the results show that the proposed method has a clear advantage in distinguishing compact, discontinuous, and small- to medium-sized feature regions and even outperforms some of the powerful superpixel-level fusion models proposed in recent years. In addition, we find that different models exhibit different discriminative abilities when dealing with feature regions of different characteristics. In particular, the classification performance is significantly improved by combining these models with our approach. Our code is open-source on the public platform GitHub: https://github.com/LittleBlackBearLiXin/Pixel-level-graph-neural-networks-based-on-optimized-feature-representation-for-hyperspectral-image.

IEEE AccessVol. 13
Harbin University of Commerce (CN)
Openalex Percentile: Top 82%
Face and Expression Recognition
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.