Graph-Weighted Contrastive Learning for Semi-Supervised Hyperspectral Image Classification
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916657911300096 |
|---|---|
| author | Zhang, Yuqing Han, Qi Wang, Ligeng Cheng, Kai Wang, Bo Zhan, Kun |
| author_facet | Zhang, Yuqing Han, Qi Wang, Ligeng Cheng, Kai Wang, Bo Zhan, Kun |
| contents | Most existing graph-based semi-supervised hyperspectral image classification methods rely on superpixel partitioning techniques. However, they suffer from misclassification of certain pixels due to inaccuracies in superpixel boundaries, \ie, the initial inaccuracies in superpixel partitioning limit overall classification performance. In this paper, we propose a novel graph-weighted contrastive learning approach that avoids the use of superpixel partitioning and directly employs neural networks to learn hyperspectral image representation. Furthermore, while many approaches require all graph nodes to be available during training, our approach supports mini-batch training by processing only a subset of nodes at a time, reducing computational complexity and improving generalization to unseen nodes. Experimental results on three widely-used datasets demonstrate the effectiveness of the proposed approach compared to baselines relying on superpixel partitioning. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_15731 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Graph-Weighted Contrastive Learning for Semi-Supervised Hyperspectral Image Classification Zhang, Yuqing Han, Qi Wang, Ligeng Cheng, Kai Wang, Bo Zhan, Kun Computer Vision and Pattern Recognition Most existing graph-based semi-supervised hyperspectral image classification methods rely on superpixel partitioning techniques. However, they suffer from misclassification of certain pixels due to inaccuracies in superpixel boundaries, \ie, the initial inaccuracies in superpixel partitioning limit overall classification performance. In this paper, we propose a novel graph-weighted contrastive learning approach that avoids the use of superpixel partitioning and directly employs neural networks to learn hyperspectral image representation. Furthermore, while many approaches require all graph nodes to be available during training, our approach supports mini-batch training by processing only a subset of nodes at a time, reducing computational complexity and improving generalization to unseen nodes. Experimental results on three widely-used datasets demonstrate the effectiveness of the proposed approach compared to baselines relying on superpixel partitioning. |
| title | Graph-Weighted Contrastive Learning for Semi-Supervised Hyperspectral Image Classification |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2503.15731 |