Scholarlink

<p>Hyperspectral image (HSI) classification faces challenges in diverse scenarios due to spectral-spatial complexity and class imbalance. Existing methods lack generalizability. This paper presents a novel Graph-Convolutional Networks with Adaptive Region Ensembles (GCN-ARE) framework. It integrates graph spectral learning, dynamic region subdivision, and classifier fusion. The key contributions are as follows: First, a normalized graph Laplacian operator ensures graph spectral stability, bounding the eigenvalue spectrum to stabilize feature propagation and address gradient issues in irregular terrains. Second, recursive K-means clustering under empirical risk bounds achieves adaptive region optimality, dynamically partitioning complex regions for enhanced local discriminability. Third, theoretical guarantees based on Hoeffding’s inequality enable dynamic ensemble consistency, facilitating optimal classifier selection under spatial-spectral uncertainty. Experiments on four HSI datasets (Botswana, Houston, Indian Pines, WHU-Hi-LongKou) show that GCN-ARE outperforms benchmarks like ViT and GAT, with average OA improvements of 1.5–5.7%. Ablation studies confirm the importance of adaptive subdivision and ensemble modules, and parameter sensitivity analyses reveal its robustness. The framework sets a new standard for robust HSI classification with its theoretical rigor and practical efficacy.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Collaborative representation and confidence-driven semi-supervised learning for hyperspectral image classification

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年1月24日

查看全文
  • Yutian Chen,
  • Hongliang Lu,
  • Xianglin Huang

摘要

Hyperspectral image (HSI) classification faces challenges in diverse scenarios due to spectral-spatial complexity and class imbalance. Existing methods lack generalizability. This paper presents a novel Graph-Convolutional Networks with Adaptive Region Ensembles (GCN-ARE) framework. It integrates graph spectral learning, dynamic region subdivision, and classifier fusion. The key contributions are as follows: First, a normalized graph Laplacian operator ensures graph spectral stability, bounding the eigenvalue spectrum to stabilize feature propagation and address gradient issues in irregular terrains. Second, recursive K-means clustering under empirical risk bounds achieves adaptive region optimality, dynamically partitioning complex regions for enhanced local discriminability. Third, theoretical guarantees based on Hoeffding’s inequality enable dynamic ensemble consistency, facilitating optimal classifier selection under spatial-spectral uncertainty. Experiments on four HSI datasets (Botswana, Houston, Indian Pines, WHU-Hi-LongKou) show that GCN-ARE outperforms benchmarks like ViT and GAT, with average OA improvements of 1.5–5.7%. Ablation studies confirm the importance of adaptive subdivision and ensemble modules, and parameter sensitivity analyses reveal its robustness. The framework sets a new standard for robust HSI classification with its theoretical rigor and practical efficacy.