mlsanityData to 14 Oct 2026

Joint Superpixel and Self-Representation Learning for Scalable Hyperspectral Image Clustering

arXiv 2509.24027 ↗First posted 28 Sep 2025cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Subspace clustering is a powerful unsupervised approach for hyperspectral image (HSI) analysis, but its high computational and memory costs limit scalability. Superpixel segmentation can improve efficiency by reducing the number of data points to process. However, existing superpixel-based methods usually perform segmentation independently of the clustering task, often producing partitions that do not align with the subsequent clustering objective. To address this, we propose a unified end-to-end framework that jointly optimizes superpixel segmentation and subspace clustering. Its core is a feedback mechanism: a self-representation network based on unfolded Alternating Direction Method of Multipliers (ADMM) provides a model-driven signal to guide a differentiable superpixel module. This joint optimization yields clustering-aware partitions that preserve both spectral and spatial structure. Furthermore, our superpixel network learns a unique compactness parameter for each superpixel, enabling more flexible and adaptive segmentation. Extensive experiments on benchmark HSI datasets demonstrate that our method consistently achieves superior accuracy compared with state-of-the-art clustering approaches.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 21 references that are in the map. First posted on arXiv 28 Sep 2025.

Builds on

4 of 21 references.

References · 4

  1. 2019Efficient Parameter-free Clustering Using First Neighbor Relationscited by 97
  2. 2017Deep Subspace Clustering Networkscited by 94
  3. 2018SpectralNet: Spectral Clustering using Deep Neural Networkscited by 94
  4. 2021Deep Embedded K-Means Clusteringcited by 12

Built on by

Not cited yet.