Hyperspectral Image Clustering by Superpixel- Based Low-Rank Constrained Bipartite Graph Learning
- 31 May 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 21 (1545598X) , 1-5
Abstract
Large-scale hyperspectral image (HSI) clustering is a challenging and attention-grabbing problem. Most existing methods are difficult to solve high dimensionality and computational complexity in HSI. In this paper, an innovative algorithm, termed superpixel-based low-rank constrained bipartite graph learning (SLCBG) is introduced, to efficiently achieve large-scale HSI clustering. Specifically, to solve the problem of massive data and high computational memory of large-scale HSI, superpixel segmentation is adopted to obtain superpixels in this paper. The spectral distance is measured using Mahalanobis distance to better obtain the overall distribution features of HSI. Secondly, k -means is used to generate anchors based on the superpixel data, and anchor graph is constructed for each view to better represent the whole HSI. Finally, tensor Schatten- p norm and nuclear norm minimization constraints are introduced to search for the low-rank structure graphs within and between views in HSI; thus, obtaining a consensus graph with clear connectivity components for realizing clustering. Experimental results on three HSI showed the superiority of SLCBG with OA of 49.20%, 75.48% and 68.59%, respectively.Keywords
Funding Information
- National Natural Science Foundation of China (42301440)
- Guizhou Provincial Science and Technology Projects ([2022]133)
- Guizhou University Ph.D. Fund ((2021)67)
This publication has 19 references indexed in Scilit:
- Low-rank constraint bipartite graph learningNeurocomputing, 2022
- Fuzzy Embedded Clustering Based on Bipartite Graph for Large-Scale Hyperspectral ImageIEEE Geoscience and Remote Sensing Letters, 2021
- Bipartite Graph Partition Based Coclustering With Joint Sparsity for Hyperspectral ImagesIEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2019
- An Efficient Algorithm for Hyperspectral Image Clustering2019
- Sequential spectral clustering of hyperspectral remote sensing image over bipartite graphApplied Soft Computing, 2018
- Low-Rank Sparse Subspace for Spectral ClusteringIEEE Transactions on Knowledge and Data Engineering, 2018
- Fast Spectral Clustering With Anchor Graph for Large Hyperspectral ImagesIEEE Geoscience and Remote Sensing Letters, 2017
- Spatial Group Sparsity Regularized Nonnegative Matrix Factorization for Hyperspectral UnmixingIEEE Transactions on Geoscience and Remote Sensing, 2017
- Spectral methods for graph clustering – A surveyEuropean Journal of Operational Research, 2011
- On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations IProceedings of the National Academy of Sciences, 1949