Robust Spectral Clustering Incorporating Statistical Sub-Graph Affinity Model

Abstract

Hyperspectral image (HSI) clustering is a challenging work due to its high complexity. Subspace clustering has been proven to successfully excavate the intrinsic relationships between data points, while traditional subspace clustering methods ignore the inherent structural information between data points. This study uses graph convolutional subspace clustering (GCSC) for robust HSI clustering. The model remaps the self-expression of the data to non-Euclidean domains, which can generate a robust graph embedding dictionary. The EKGCSC model can achieve a globally optimal closed-form solution by using a subspace clustering model with the Frobenius norm and a Gaussian kernel function, making it easier to implement, train, and apply. However, the presence of noise can have a noteworthy negative impact on the segmentation performance. To diminish the impact of image noise, the concept of sub-graph affinity is introduced, where each node in the primary graph is modeled as a sub-graph describing the neighborhood around the node. A statistical sub-graph affinity matrix is then constructed based on the statistical relationships between sub-graphs of connected nodes in the primary graph, thus counteracting the uncertainty image noise by using more information. The model used in this work was named statistical sub-graph affinity kernel graph convolutional subspace clustering (SSAKGCSC). Experiment results on Salinas, Indian Pines, Pavia Center, and Pavia University data sets showed that the SSAKGCSC model can achieve improved segmentation performance and better noise resistance ability.

Robust spectral clustering integrated nonlocal information blocks for hyperspectral image classification

“…This model uses an approach similar to EGCSC to construct the affinity matrix and obtain the final clustering result through SC. Statistical subgraph affinity kernel graph convolutional subspace clustering (SSAKGCSC), 47 based on the EKGCSC model, the concept of subgraph affinity is introduced, in which every node in the main graph is modeled as a subgraph describing the neighborhood around the node. Then a statistical subgraph affinity matrix is constructed according to the statistical relationship between the subgraphs connecting nodes in the main graph so that more information can be used to offset the uncertain image noise.…”