Search

Hyperspectral images contain rich spatial–spectral information and have high dimensions, which can lead to challenges related to feature extraction for classification tasks, resulting in suboptimal performance. We propose a hyperspectral image dimensionality reduction algorithm based on spatial–spectral adaptive multiple manifolds to address the problem of small differences between features of dissimilar samples in the subspace caused by the uniform projection transformation in traditional dimensionality reduction methods. Firstly, to address spatial boundary mismatch problems caused by re-characterizing a pixel using pixels in a fixed area around it as its near neighbors in traditional algorithms, an adaptive weight representation method based on super-pixel segmentation is proposed, which enhances the similarity of similar samples and the dissimilarity of dissimilar samples. Secondly, to address the problem that a single manifold cannot completely characterize the near neighbor between samples of different categories, an adaptive multi-manifold representation method is proposed. The feature representation of the entire hyperspectral data in the low-dimensional subspace is obtained by adaptively fusing the intra- and inter-manifold maps constructed for each category of samples in the spatial and spectral dimensions. Experimental results on two public datasets show that the proposed method achieves better results when performing the hyperspectral image dimensionality reduction task. [ABSTRACT FROM AUTHOR]