scholarly journals Multiscale Superpixelwise Locality Preserving Projection for Hyperspectral Image Classification

2019 ◽  
Vol 9 (10) ◽  
pp. 2161
Author(s):  
Lin He ◽  
Xianjun Chen ◽  
Jun Li ◽  
Xiaofeng Xie
Keyword(s):  
Manifold Learning ◽  
Hyperspectral Image ◽  
Decision Fusion ◽  
Hyperspectral Data ◽  
Data Sets ◽  
Dimensional Manifold ◽  
Locality Preserving Projection ◽  
Locality Preserving ◽  
Low Dimensional ◽  
Low Dimensional Manifold

Manifold learning is a powerful dimensionality reduction tool for a hyperspectral image (HSI) classification to relieve the curse of dimensionality and to reveal the intrinsic low-dimensional manifold. However, a specific characteristic of HSIs, i.e., irregular spatial dependency, is not taken into consideration in the method design, which can yield many spatially homogenous subregions in an HSI scence. Conventional manifold learning methods, such as a locality preserving projection (LPP), pursue a unified projection on the entire HSI, while neglecting the local homogeneities on the HSI manifold caused by those spatially homogenous subregions. In this work, we propose a novel multiscale superpixelwise LPP (MSuperLPP) for HSI classification to overcome the challenge. First, we partition an HSI into homogeneous subregions with a multiscale superpixel segmentation. Then, on each scale, subregion specific LPPs and the associated preliminary classifications are performed. Finally, we aggregate the classification results from all scales using a decision fusion strategy to achieve the final result. Experimental results on three real hyperspectral data sets validate the effectiveness of our method.

An Incremental Isomap Method for Hyperspectral Dimensionality Reduction and Classification

2021 ◽  
Vol 87 (6) ◽  
pp. 445-455
Author(s):  
Yi Ma ◽  
Zezhong Zheng ◽  
Yutang Ma ◽  
Mingcang Zhu ◽  
Ran Huang ◽  
...  
Keyword(s):  
Manifold Learning ◽  
Nearest Neighbor ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Training Data ◽  
Support Vector ◽  
Data Sets ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Data Points

Many manifold learning algorithms conduct an eigen vector analysis on a data-similarity matrix with a size of N×N, where N is the number of data points. Thus, the memory complexity of the analysis is no less than O(N2). We pres- ent in this article an incremental manifold learning approach to handle large hyperspectral data sets for land use identification. In our method, the number of dimensions for the high-dimensional hyperspectral-image data set is obtained with the training data set. A local curvature varia- tion algorithm is utilized to sample a subset of data points as landmarks. Then a manifold skeleton is identified based on the landmarks. Our method is validated on three AVIRIS hyperspectral data sets, outperforming the comparison algorithms with a k–nearest-neighbor classifier and achieving the second best performance with support vector machine.

scholarly journals Classification of Infrared Objects in Manifold Space Using Kullback-Leibler Divergence of Gaussian Distributions of Image Points

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 434 ◽  
Author(s):  
Huilin Ge ◽  
Zhiyu Zhu ◽  
Kang Lou ◽  
Wei Wei ◽  
Runbang Liu ◽  
...  
Keyword(s):  
Manifold Learning ◽  
Gaussian Distribution ◽  
Classification Accuracy ◽  
Infrared Image ◽  
Data Sets ◽  
Dimensional Manifold ◽  
Infrared Images ◽  
Leibler Divergence ◽  
Data Points ◽  
Low Dimensional

Infrared image recognition technology can work day and night and has a long detection distance. However, the infrared objects have less prior information and external factors in the real-world environment easily interfere with them. Therefore, infrared object classification is a very challenging research area. Manifold learning can be used to improve the classification accuracy of infrared images in the manifold space. In this article, we propose a novel manifold learning algorithm for infrared object detection and classification. First, a manifold space is constructed with each pixel of the infrared object image as a dimension. Infrared images are represented as data points in this constructed manifold space. Next, we simulate the probability distribution information of infrared data points with the Gaussian distribution in the manifold space. Then, based on the Gaussian distribution information in the manifold space, the distribution characteristics of the data points of the infrared image in the low-dimensional space are derived. The proposed algorithm uses the Kullback-Leibler (KL) divergence to minimize the loss function between two symmetrical distributions, and finally completes the classification in the low-dimensional manifold space. The efficiency of the algorithm is validated on two public infrared image data sets. The experiments show that the proposed method has a 97.46% classification accuracy and competitive speed in regards to the analyzed data sets.

scholarly journals The Value of Manifold Learning Algorithms in Simplifying Complex Datasets for More Efficacious Analysis

2020 ◽  
pp. 13-20
Author(s):  
Muhammad Amjad
Keyword(s):  
Data Analysis ◽  
Manifold Learning ◽  
Dimensional Space ◽  
Feature Space ◽  
Topological Data Analysis ◽  
High Dimensional ◽  
Dimensional Manifold ◽  
Low Dimensional ◽  
Low Dimensional Manifold ◽  
Complex Datasets

Advances in manifold learning have proven to be of great benefit in reducing the dimensionality of large complex datasets. Elements in an intricate dataset will typically belong in high-dimensional space as the number of individual features or independent variables will be extensive. However, these elements can be integrated into a low-dimensional manifold with well-defined parameters. By constructing a low-dimensional manifold and embedding it into high-dimensional feature space, the dataset can be simplified for easier interpretation. In spite of this elemental dimensionality reduction, the dataset’s constituents do not lose any information, but rather filter it with the hopes of elucidating the appropriate knowledge. This paper will explore the importance of this method of data analysis, its applications, and its extensions into topological data analysis.

scholarly journals An Optimization Technique for Linear Manifold Learning-Based Dimensionality Reduction: Evaluations on Hyperspectral Images

2021 ◽  
Vol 11 (19) ◽  
pp. 9063
Author(s):  
Ümit Öztürk ◽  
Atınç Yılmaz
Keyword(s):  
Manifold Learning ◽  
Classification Accuracy ◽  
Learning Algorithms ◽  
Linear Manifold ◽  
Optimization Technique ◽  
Distance Matrix ◽  
Locality Preserving Projection ◽  
Redundant Data ◽  
Locality Preserving ◽  
Low Dimensional

Manifold learning tries to find low-dimensional manifolds on high-dimensional data. It is useful to omit redundant data from input. Linear manifold learning algorithms have applicability for out-of-sample data, in which they are fast and practical especially for classification purposes. Locality preserving projection (LPP) and orthogonal locality preserving projection (OLPP) are two known linear manifold learning algorithms. In this study, scatter information of a distance matrix is used to construct a weight matrix with a supervised approach for the LPP and OLPP algorithms to improve classification accuracy rates. Low-dimensional data are classified with SVM and the results of the proposed method are compared with some other important existing linear manifold learning methods. Class-based enhancements and coefficients proposed for the formulization are reported visually. Furthermore, the change on weight matrices, band information, and correlation matrices with p-values are extracted and visualized to understand the effect of the proposed method. Experiments are conducted on hyperspectral imaging (HSI) with two different datasets. According to the experimental results, application of the proposed method with the LPP or OLPP algorithms outperformed traditional LPP, OLPP, neighborhood preserving embedding (NPE) and orthogonal neighborhood preserving embedding (ONPE) algorithms. Furthermore, the analytical findings on visualizations show consistency with obtained classification accuracy enhancements.

Locality Preserving Projection Based on Endmember Extraction for Hyperspectral Image Dimensionality Reduction and Target Detection

2016 ◽  
Vol 70 (9) ◽  
pp. 1573-1581 ◽  
Author(s):  
Yiting Wang ◽  
Shiqi Huang ◽  
Zhigang Liu ◽  
Hongxia Wang ◽  
Daizhi Liu
Keyword(s):  
Dimensionality Reduction ◽  
Target Detection ◽  
Hyperspectral Image ◽  
Image Data ◽  
Hyperspectral Data ◽  
Detection Accuracy ◽  
Endmember Extraction ◽  
Locality Preserving Projection ◽  
Locality Preserving ◽  
Weighted Matrix

In order to reduce the effect of spectral variability on calculation precision for the weighted matrix in the locality preserving projection (LPP) algorithm, an improved dimensionality reduction method named endmember extraction-based locality preserving projection (EE-LPP) is proposed in this paper. The method primarily uses the vertex component analysis (VCA) method to extract endmember spectra from hyperspectral imagery. It then calculates the similarity between pixel spectra and the endmember spectra by using the spectral angle distance, and uses it as the basis for selecting neighboring pixels in the image and constructs a weighted matrix between pixels. Finally, based on the weighted matrix, the idea of the LPP algorithm is applied to reduce the dimensions of hyperspectral image data. Experimental results of real hyperspectral data demonstrate that the low-dimensional features acquired by the proposed methods can fully reflect the characteristics of the original image and further improve target detection accuracy.

Dimension Reduction of Local Manifold Learning Algorithm for Hyperspectral Image Classification

2013 ◽  
pp. 217-231
Author(s):  
Sheng Ding ◽  
Li Chen ◽  
Jun Li
Keyword(s):  
Dimension Reduction ◽  
Image Classification ◽  
Manifold Learning ◽  
Hyperspectral Image ◽  
Data Representation ◽  
Data Sets ◽  
Hyperspectral Image Classification ◽  
Learning Methods ◽  
Multiple Data ◽  
Low Dimensional

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.

scholarly journals Low-dimensional manifold of actin polymerization dynamics

2017 ◽  
Vol 19 (12) ◽  
pp. 125012 ◽  
Author(s):  
Carlos Floyd ◽  
Christopher Jarzynski ◽  
Garegin Papoian
Keyword(s):  
Actin Polymerization ◽  
Dimensional Manifold ◽  
Low Dimensional ◽  
Low Dimensional Manifold

Novel method for bearing performance degradation assessment – A kernel locality preserving projection-based approach

2013 ◽  
Vol 228 (3) ◽  
pp. 548-560 ◽  
Author(s):  
Chuang Sun ◽  
Zhousuo Zhang ◽  
Zhengjia He ◽  
Zhongjie Shen ◽  
Binqiang Chen ◽  
...  
Keyword(s):  
Test Data ◽  
Performance Degradation ◽  
Inner Product ◽  
Data Sets ◽  
Degradation Index ◽  
Locality Preserving Projection ◽  
Locality Preserving ◽  
Non Linear ◽  
Linear Information ◽  
Novel Method

Bearing performance degradation assessment is meaningful for keeping mechanical reliability and safety. For this purpose, a novel method based on kernel locality preserving projection is proposed in this article. Kernel locality preserving projection extends the traditional locality preserving projection into the non-linear form by using a kernel function and it is more appropriate to explore the non-linear information hidden in the data sets. Considering this point, the kernel locality preserving projection is used to generate a non-linear subspace from the normal bearing data. The test data are then projected onto the subspace to obtain an index for assessing bearing degradation degrees. The degradation index that is expressed in the form of inner product indicates similarity of the normal data and the test data. Validations by using monitoring data from two experiments show the effectiveness of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document