Semi-supervised Superpixel-based Multi-Feature Graph Learning for Hyperspectral Image Data
Madeleine Kotzagiannidis, Carola-Bibiane Sch\"onlieb

TL;DR
This paper introduces a novel semi-supervised graph learning framework for hyperspectral image classification that leverages superpixel features and pseudo-labels to improve accuracy with limited labeled data.
Contribution
The work presents a multi-stage, edge-efficient graph construction method and an extension that integrates multiple superpixel features, reducing reliance on parameter tuning.
Findings
Outperforms state-of-the-art methods in HSI classification
Effective with limited labeled data
Demonstrates robustness across various datasets
Abstract
Graphs naturally lend themselves to model the complexities of Hyperspectral Image (HSI) data as well as to serve as semi-supervised classifiers by propagating given labels among nearest neighbours. In this work, we present a novel framework for the classification of HSI data in light of a very limited amount of labelled data, inspired by multi-view graph learning and graph signal processing. Given an a priori superpixel-segmented hyperspectral image, we seek a robust and efficient graph construction and label propagation method to conduct semi-supervised learning (SSL). Since the graph is paramount to the success of the subsequent classification task, particularly in light of the intrinsic complexity of HSI data, we consider the problem of finding the optimal graph to model such data. Our contribution is two-fold: firstly, we propose a multi-stage edge-efficient semi-supervised graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
