提出轻量级自监督图聚类方法,提升高光谱图像聚类精度与抗噪能力。
SLCGC: A lightweight Self-supervised Low-pass Contrastive Graph Clustering Network for Hyperspectral Images
- 先生成同质区域降维图复杂度,再用低通滤波抑制图结构噪声。
- 双分支对比学习通过高斯扰动生成视图,提升特征对噪声的鲁棒性。
- 方法高效稳定,适合资源受限场景下的高光谱图像聚类任务。
自监督高光谱图像(HSI)聚类因缺乏标注数据且空间-光谱交互复杂而具有挑战性。现有方法在聚类精度、特征区分性、计算效率及抗噪性方面存在不足。本文提出轻量级自监督低通对比图聚类网络(SLCGC)。首先生成光谱一致的同质区域,保留局部空间-光谱一致性并大幅降低图复杂度;随后构建结构图并引入低通图去噪机制,抑制图拓扑中的高频噪声,确保特征传播稳定;设计双分支图对比学习模块,通过两个MLP对高斯噪声扰动生成增强视图,利用跨视图对比损失强制结构一致性,学习噪声不变表示;最后基于优化后的嵌入进行K-means聚类。大量实验和重复对比分析验证了SLCGC具备高聚类准确率、低计算复杂度与强抗噪性。代码将开源于https://github.com/DY-HYX。
原文摘要 · Abstract (English)
Self-supervised hyperspectral image (HSI) clustering remains a fundamental yet challenging task due to the absence of labeled data and the inherent complexity of spatial-spectral interactions. While recent advancements have explored innovative approaches, existing methods face critical limitations in clustering accuracy, feature discriminability, computational efficiency, and robustness to noise, hindering their practical deployment. In this paper, a self-supervised efficient low-pass contrastive graph clustering (SLCGC) is introduced for HSIs. Our approach begins with homogeneous region generation, which aggregates pixels into spectrally consistent regions to preserve local spatial-spectral coherence while drastically reducing graph complexity. We then construct a structural graph using an adjacency matrix A and introduce a low-pass graph denoising mechanism to suppress high-frequency noise in the graph topology, ensuring stable feature propagation. A dual-branch graph contrastive learning module is developed, where Gaussian noise perturbations generate augmented views through two multilayer perceptrons (MLPs), and a cross-view contrastive loss enforces structural consistency between views to learn noise-invariant representations. Finally, latent embeddings optimized by this process are clustered via K-means. Extensive experiments and repeated comparative analysis have verified that our SLCGC contains high clustering accuracy, low computational complexity, and strong robustness. The code source will be available at https://github.com/DY-HYX.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。