Dimension Reduction of Local Manifold Learning Algorithm for Hyperspectral Image Classification

Author(s):  
Sheng Ding ◽  
Li Chen ◽  
Jun Li

This chapter addresses the problems in hyperspectral image classification by the methods of local manifold learning methods. A manifold is a nonlinear low dimensional subspace that is supported by data samples. Manifolds can be exploited in developing robust feature extraction and classification methods. The manifold coordinates derived from local manifold learning (LLE, LE) methods for multiple data sets. With a proper selection of parameters and a sufficient number of features, the manifold learning methods using the k-nearest neighborhood classification results produced an efficient and accurate data representation that yields higher classification accuracies than linear dimension reduction (PCA) methods for hyperspectral image.

2018 ◽  
Vol 246 ◽  
pp. 03041
Author(s):  
Cailing Wang ◽  
Hongwei Wang ◽  
Yinyong Zhang ◽  
Jia Wen ◽  
Fan Yang

Making a high dimensional (e.g., 100k-dim) feature for hyperspectral image classification seems not a good idea because it will bring difficulties on consequent training, computation, and storage. In this paper, we study the performance of a high-dimensional feature by texture feature. The texture feature based on multi-local binary pattern descriptor, can achieve significant improvements over both its tradition version and the one we proposed in our previous work. We also make the high-dimensional feature practical, we employ the PCA method for dimension reduction and support vector machine for hyperspectral image classification. The two real hyperspectral image datasets are employed. Our experimental results with real hyperspectral images indicate that the high dimensional feature can enhance the classification accuracy than some low dimensional.


Author(s):  
ZHENG Zhijun ◽  
PENG Yanbin

Aiming at the problem of "dimension disaster" in hyperspectral image classification, a method of dimension reduction based on manifold data analysis and sparse subspace projection (MDASSP) is proposed. The sparse coefficient matrix is established by the new method, and the sparse subspace projection is carried out by the optimization method. To keep the geometric structure of the manifold, the objective function is regularized by the manifold learning method. The new method combines sparse coding and manifold learning to generate features with better classification ability. The experimental results show that the new method is better than other methods in the case of small samples.


Sign in / Sign up

Export Citation Format

Share Document