Graph-Constrained Residual Self-Expressive Subspace Clustering Network for Hyperspectral Images

Abstract

Hyperspectral images are widely use due to their rich spectral information. Meanwhile, the difficult acquisition of data labels makes unsupervised classification attracts attention. Subspace clustering as an unsupervised classification method is widely used for hyperspectral image analysis because of its excellent performance and robustness. However, conventional subspace clustering does not consider the nonlinear structure of hyperspectral data, and deep subspace clustering tends to ignore the intrinsic structure of hyperspectral data. To address these problems, we developed a self-expressive learning network, ResSENet, for hyperspectral data; we then proposed the application of ResSENet under graph constraints (GC-ResSENet), considering the intrinsic graph structure of the data. Unlike conventional deep subspace clustering, our model discards the self-expressive layer; self-expressive coefficients between datasets are directly solved by the data using network parameters. Hyperparameters are used in the joint loss to balance the self-expressive properties of the data and the graph constraint terms. We evaluated GC-ResSENet by applying it to four well-known datasets, and our network achieved optimal performance. In addition, because of its abandonment of the self-expressive layer, ResSENet is theoretically capable of clustering with large datasets; thus, we evaluated it using two large datasets.

Keywords

• Deep subspace clustering (DSC)
• graph convolution
• hyperspectral clustering
• self-expressive network