mHC-HSI: Clustering-Guided Hyper-Connection Mamba for Hyperspectral Image Classification

• URL: http://arxiv.org/abs/2603.03418v1
• Date: Tue, 03 Mar 2026 18:56:40 GMT
• Title: mHC-HSI: Clustering-Guided Hyper-Connection Mamba for Hyperspectral Image Classification
• Authors: Yimin Zhu, Zack Dewis, Quinn Ledingham, Saeid Taleghanidoozdoozan, Mabel Heffring, Zhengsen Xu, Motasem Alkayid, Megan Greenwood, Lincoln Linlin Xu,
• Abstract summary: This paper presents a clustering-guided mHC Mamba model (CalgarymHC-HSI) for enhanced HSI classification.<n>The proposed approach is tested on benchmark datasets in comparison with the state-of-the-art methods.
• Score: 2.3379613890114395
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recently, DeepSeek has invented the manifold-constrained hyper-connection (mHC) approach which has demonstrated significant improvements over the traditional residual connection in deep learning models \cite{xie2026mhc}. Nevertheless, this approach has not been tailor-designed for improving hyperspectral image (HSI) classification. This paper presents a clustering-guided mHC Mamba model (mHC-HSI) for enhanced HSI classification, with the following contributions. First, to improve spatial-spectral feature learning, we design a novel clustering-guided Mamba module, based on the mHC framework, that explicitly learns both spatial and spectral information in HSI. Second, to decompose the complex and heterogeneous HSI into smaller clusters, we design a new implementation of the residual matrix in mHC, which can be treated as soft cluster membership maps, leading to improved explainability of the mHC approach. Third, to leverage the physical spectral knowledge, we divide the spectral bands into physically-meaningful groups and use them as the "parallel streams" in mHC, leading to a physically-meaningful approach with enhanced interpretability. The proposed approach is tested on benchmark datasets in comparison with the state-of-the-art methods, and the results suggest that the proposed model not only improves the accuracy but also enhances the model explainability. Code is available here: https://github.com/GSIL-UCalgary/mHC_HyperSpectral

Related papers

• JPmHC Dynamical Isometry via Orthogonal Hyper-Connections [2.4311915994390403]
  JPmHC is a framework that replaces identity skips with a trainable linear mixer acting on n parallel streams.<n>It prevents gradient pathologies and enhances stability.<n>It achieves faster convergence, higher accuracy, and lower computational cost compared to bistochastic baselines.
  arXiv  Detail & Related papers  (2026-02-20T16:06:01Z)
• Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering [73.01141916544103]
  Hyperspectral image (HSI) clustering groups pixels into clusters without labeled data.<n>Most methods rely on superpixel segmentation and perform superpixel-level clustering based on graph neural networks (GNNs)<n>We propose a structural-spectral graph convolutional operator (SSGCO) tailored for graph-structured HSI superpixels to improve representation quality.
  arXiv  Detail & Related papers  (2025-06-11T16:41:34Z)
• MambaMoE: Mixture-of-Spectral-Spatial-Experts State Space Model for Hyperspectral Image Classification [46.67137351665963]
  Mamba-based models have recently demonstrated significant potential in hyperspectral image (HSI) classification.<n>We propose MambaMoE, a novel spectral-spatial Mixture-of-Experts (MoE) framework, which represents the first MoE-based approach in the HSI classification domain.<n>MambaMoE achieves state-of-the-art performance in both classification accuracy and computational efficiency compared to existing advanced methods.
  arXiv  Detail & Related papers  (2025-04-29T07:50:36Z)
• Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective [52.662463893268225]
  Self-supervised heterogeneous graph learning (SHGL) has shown promising potential in diverse scenarios.<n>Existing SHGL methods encounter two significant limitations.<n>We introduce a novel framework enhanced by rank and dual consistency constraints.
  arXiv  Detail & Related papers  (2024-12-01T09:33:20Z)
• Self-Supervised Graph Embedding Clustering [70.36328717683297]
  K-means one-step dimensionality reduction clustering method has made some progress in addressing the curse of dimensionality in clustering tasks. We propose a unified framework that integrates manifold learning with K-means, resulting in the self-supervised graph embedding framework.
  arXiv  Detail & Related papers  (2024-09-24T08:59:51Z)
• GCC: Generative Calibration Clustering [55.44944397168619]
  We propose a novel Generative Clustering (GCC) method to incorporate feature learning and augmentation into clustering procedure. First, we develop a discrimirative feature alignment mechanism to discover intrinsic relationship across real and generated samples. Second, we design a self-supervised metric learning to generate more reliable cluster assignment.
  arXiv  Detail & Related papers  (2024-04-14T01:51:11Z)
• Unfolding ADMM for Enhanced Subspace Clustering of Hyperspectral Images [43.152314090830174]
  We introduce an innovative clustering architecture for hyperspectral images (HSI) by unfolding an iterative solver based on the Alternating Direction Method of Multipliers (ADMM) for sparse subspace clustering. Our approach captures well the structural characteristics of HSI data by employing the K nearest neighbors algorithm as part of a structure preservation module.
  arXiv  Detail & Related papers  (2024-04-10T15:51:46Z)
• Superpixel Graph Contrastive Clustering with Semantic-Invariant Augmentations for Hyperspectral Images [73.01141916544103]
  Hyperspectral images (HSI) clustering is an important but challenging task.<n>We first use 3-D and 2-D hybrid convolutional neural networks to extract the high-order spatial and spectral features of HSI.<n>We then design a superpixel graph contrastive clustering model to learn discriminative superpixel representations.
  arXiv  Detail & Related papers  (2024-03-04T07:40:55Z)
• Multiview Subspace Clustering of Hyperspectral Images based on Graph Convolutional Networks [12.275530282665578]
  This study proposes a multiview subspace clustering of hy-perspectral images (HSI) based on graph convolutional networks. The model was evaluated on three popular HSI datasets, including Indian Pines, Pavia University, and Houston. It achieved overall accuracies of 92.38%, 93.43%, and 83.82%, respectively, and significantly outperformed the state-of-the-art clustering methods.
  arXiv  Detail & Related papers  (2024-03-03T10:19:18Z)
• Contrastive Multi-view Subspace Clustering of Hyperspectral Images based on Graph Convolutional Networks [14.978666092012856]
  Subspace clustering is an effective approach for clustering hyperspectral images. In this study, contrastive multi-view subspace clustering of HSI was proposed based on graph convolutional networks. The proposed model effectively improves the clustering accuracy of HSI.
  arXiv  Detail & Related papers  (2023-12-11T02:22:10Z)
• Cross-Attention in Coupled Unmixing Nets for Unsupervised Hyperspectral Super-Resolution [79.97180849505294]
  We propose a novel coupled unmixing network with a cross-attention mechanism, CUCaNet, to enhance the spatial resolution of HSI. Experiments are conducted on three widely-used HS-MS datasets in comparison with state-of-the-art HSI-SR models.
  arXiv  Detail & Related papers  (2020-07-10T08:08:20Z)
• Graph Convolutional Subspace Clustering: A Robust Subspace Clustering Framework for Hyperspectral Image [6.332208511335129]
  We present a novel subspace clustering framework called Graph Convolutional Subspace Clustering (GCSC) for robust HSI clustering. Specifically, the framework recasts the self-expressiveness property of the data into the non-Euclidean domain. We show that traditional subspace clustering models are the special forms of our framework with the Euclidean data.
  arXiv  Detail & Related papers  (2020-04-22T10:09:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.