Multi-Objective Sparse Subspace Clustering for Hyperspectral Imagery
- 8 November 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 58 (4) , 2290-2307
Abstract
Hyperspectral images (HSIs) are typical high-dimensional and complex data. As such, the clustering of HSIs is a challenging task. Out of the motivation to find the low-dimensional structure representation of the high-dimensional data, sparse subspace clustering (SSC) methods have been proposed in recent studies. Sparse representation is an important technique in SSC, which is aimed at obtaining the sparse coefficient matrix of the HSI data. Generally speaking, the acquisition of the sparse coefficient matrix is an ill-posed problem, and the existing methods introduce an extra condition as a regularization term to resolve it. However, the regularization parameter is determined manually, which is difficult and lacks self-adaptability. Hence, in this article, a multi-objective SSC method for hyperspectral imagery is proposed, which simultaneously optimizes the sparse term and the data fidelity term. In addition, the spatial structure information of the HSIs is often neglected in the processing model, and thus, a spatial prior term, as the third optimization objective function, is also tested in this article. As a result, there is no need to manually set a regularization parameter. Furthermore, by using the l₀ norm as the sparse term, this reduces the error caused by the convex relaxation of the other norms. In the proposed method, a multi-objective optimization model is first used to acquire the sparse coefficient matrix, in which a strategy for constructing the dictionary is proposed for more precise and efficient multi-objective optimization. In addition, a knee point-based selection method is utilized to automatically select the optimal sparse representation solution from the Pareto front. The adjacency matrix is then constructed according to the sparse coefficient matrix. Finally, a spectral clustering method is used to obtain clustering results. Experiments undertaken with four HSI data sets confirm the effectiveness of the proposed method.Keywords
Funding Information
- National Basic Research Program of China (2017YFB0504202)
- National Natural Science Foundation of China (41622107, 41771385, 41801267)
- Fundamental Research Funds for the Central Universities (2042018kf0229)
This publication has 61 references indexed in Scilit:
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of MultipliersFoundations and Trends in Machine Learning, 2011
- Artificial immune multi-objective SAR image segmentation with fused complementary featuresInformation Sciences, 2011
- Parallelism and evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Comparison of Multiobjective Evolutionary Algorithms: Empirical ResultsEvolutionary Computation, 2000
- Metrics and models for handwritten character recognitionStatistical Science, 1998
- A computational algorithm for minimizing total variation in image restorationIEEE Transactions on Image Processing, 1996
- An Overview of Evolutionary Algorithms in Multiobjective OptimizationEvolutionary Computation, 1995
- Orthogonal least squares learning algorithm for radial basis function networksIEEE Transactions on Neural Networks, 1991
- Imaging Spectrometry for Earth Remote SensingScience, 1985