MALNISI-Infused Graph Construction and Weighted Contrastive Loss based GAT for Unsupervised Representation Learning in HSI

Soumi Sarkar, Subhadip Boral, Sarbani Palit, Ashish GhosharXiv 2026 · arXiv

TL;DR

This paper introduces a novel unsupervised framework for hyperspectral image (HSI) segmentation that combines a neighborhood-aware similarity index (MALNISI) with an upgraded Graph Attention Network (GAT). By integrating structural consistency into both graph construction and a new weighted contrastive loss function, the method achieves state-of-the-art performance in clustering complex land-cover materials without requiring any labeled training data.

What Problem Does This Paper Address?

Hyperspectral images capture hundreds of narrow spectral bands, providing a "fingerprint" for every pixel. This high-dimensional data is a goldmine for identifying land-use and land-cover (LULC) materials, but it comes with significant challenges:

  1. The Curse of Dimensionality: High-dimensional data is hard to process and often contains redundant information.
  2. Noise and Variability: Traditional spectral measures (like Euclidean distance) are sensitive to noise and "intra-class variability"—where pixels of the same material look slightly different due to lighting or sensor noise.
  3. Spatial Context: Most methods look at pixels in isolation, ignoring the fact that neighboring pixels are likely to belong to the same category.

While Graph Neural Networks (GNNs) have shown promise in capturing these relationships, they often suffer from "over-smoothing" (where all node features become identical) and rely on poorly constructed initial graphs.

Methods

The authors propose a three-stage framework, as visualized in the architectural overview:

Fig. 1. Architectural overview of the proposed MALNISI-GAT framework, illustrating the three-stage semantic segmentation procedure: (1) MALNISI- based weighted graph construction, (2) unsupervised representation learning via multi-head Graph Attention Network with weighted contrastive loss, and (3) spectral clustering for segmentation.

1. MALNISI Graph Construction

The core innovation is the Mean Absolute Local Neighborhood Inverse Spectral Index (MALNISI). Instead of comparing two pixels directly, MALNISI evaluates how both pixels "see" their shared neighborhood. If two pixels have a consistent structural relationship with the points around them, they are deemed highly similar. This makes the index robust to random noise and illumination changes.

Fig. 2. Illustration and analysis of the MALNISI-based graph construction, where different colors represent different pixel category.

2. Upgraded Graph Attention Network (GAT)

The framework uses a GAT to learn low-dimensional embeddings. Unlike standard GATs, this version:

  • Injects MALNISI weights as auxiliary features to guide the attention mechanism.
  • Uses Residual Connections and Skip Projections to prevent over-smoothing, allowing the network to go deeper while preserving fine-grained spectral details.
  • Employs Layer Normalization to stabilize the learning process.

3. Weighted Contrastive Loss (WCL)

To ensure the learned embeddings are discriminative, the authors developed a novel loss function. Standard contrastive loss pulls "positive" pairs together and pushes "negative" pairs apart. The Weighted Contrastive Loss goes a step further by weighting the "pull" based on the MALNISI score. This forces the latent space to faithfully represent the complex manifold of the original hyperspectral data.

Fig. 4. Geometric visualization of the proposed weighted contrastive loss.

Datasets

The model was evaluated on six widely-used benchmark HSI datasets:

  • Indian Pines: Agricultural land in Indiana, USA.
  • Pavia University: Urban scene in Pavia, Italy.
  • Salinas: Agricultural valley in California, USA.
  • HongHu: Complex agricultural scene in Hubei, China.
  • Botswana: Wetland and vegetation in the Okavango Delta.
  • Kennedy Space Center (KSC): Wetland and vegetation in Florida, USA.

Key Insights and Ideas

  • Context is King: Point-to-point spectral similarity is often misleading. By looking at the neighborhood consistency, the model can distinguish between materials that look spectrally similar but belong to different spatial structures.
  • Guiding the Attention: Simply feeding a graph into a GAT isn't enough. Explicitly using the similarity index (MALNISI) to re-weight attention coefficients prevents the "dilution" of important edge information during training.
  • Structural Regularization: The weighted contrastive loss acts as a structural regularizer. It ensures that the "topology" of the high-dimensional hyperspectral cube is preserved even after the data is compressed into a low-dimensional embedding.

Key Results

The proposed method was compared against 14 state-of-the-art (SOTA) approaches.

  • Superior Accuracy: On the Indian Pines dataset, the method achieved an Overall Accuracy (OA) of 80.49%, outperforming the best baseline (EGFSC) by approximately 15%.
  • Better Clustering: On the Pavia University dataset, the Normalized Mutual Information (NMI) improved by 38% compared to the best-performing baseline.
  • Noise Robustness: Experimental analysis showed that the MALNISI index significantly reduces "salt-and-pepper" artifacts in the final segmentation maps compared to traditional methods.
  • Efficiency: Despite the complexity of the architecture, the model maintains stable inference times, making it practical for large-scale remote sensing applications.

Limitations and Future Work

  • Computational Complexity: The final step uses Spectral Clustering, which has cubic complexity ($O(N^3)$). This makes it computationally expensive for extremely large hyperspectral scenes.
  • Class Imbalance: Like most unsupervised methods, the model struggles with "minority classes"—small regions of a specific material that might get merged into larger, spectrally similar neighbors.
  • Future Directions: The authors suggest exploring graph sparsification techniques to improve scalability and developing adaptive mechanisms to handle class imbalance automatically.

Summary updated

Abstract

Hyperspectral images (HSI) possess discriminating spectral characteristics with respect to land utilization due to high-dimensional information. Recently, unsupervised representation learning using graph neural networks has unveiled these utilization-specific complex spectral relations. This article has three main contributions. First, it proposes an index, the Mean Absolute Local Neighborhood Inverse Spectral Index (MALNISI), which measures the similarity between two pixels based on their neighborhood information. The index is used to construct a weighted adjacency matrix, giving the HSI a graph structure. Second, it proposes an upgraded Graph Attention Network that learns compact latent representations of hyperspectral data from the constructed graph. In this network, an enhanced multi-head attention mechanism incorporates the MALNISI weights as an auxiliary feature to emphasize learned attention between neighboring pixels. To alleviate over-smoothing and preserve fine-grained spectral details, the architecture integrates residual connections, skip projections, and feature normalization, which together enhance representation capability, stabilize learning, and accelerate convergence. Third, it proposes a weighted contrastive loss function that incorporates neighborhood-aware MALNISI between connected pixels, encouraging strongly connected pixels in the high-dimensional space to remain close in the latent space, and weakly connected pixels to stay apart. The resulting discriminative low-dimensional embeddings are then clustered using spectral clustering. Experimental analysis on six benchmark HSI datasets demonstrates the efficiency and necessity of the three aforementioned contributions, and the comparative study highlights superior performance over fourteen state-of-the-art approaches.
BibTeX
@misc{sarkar2026malnisi,
  author = {Soumi Sarkar and Subhadip Boral and Sarbani Palit and Ashish Ghosh},
  title = {{MALNISI-Infused Graph Construction and Weighted Contrastive Loss based GAT for Unsupervised Representation Learning in HSI}},
  year = {2026},
  eprint = {2611.17199},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.17199},
}
Figure