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.

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.

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.

Study of Fault Diagnosis Based on Manifold Learning

2013 ◽  
Vol 312 ◽  
pp. 650-654 ◽  
Author(s):  
Yi Lin He ◽  
Guang Bin Wang ◽  
Fu Ze Xu
Keyword(s):  
Fault Diagnosis ◽  
Manifold Learning ◽  
Linear Manifold ◽  
Rotating Machinery ◽  
Dimensional Manifold ◽  
Advantages And Disadvantages ◽  
Non Linear ◽  
Future Direction ◽  
Low Dimensional ◽  
Machinery Fault Diagnosis

Characteristic signals in rotating machinery fault diagnosis with the issues of complex and difficult to deal with, while the use of non-linear manifold learning method can effectively extract low-dimensional manifold characteristics embedded in the high-dimensional non-linear data. It greatly maintains the overall geometric structure of the signals and improves the efficiency and reliability of the rotating machinery fault diagnosis. According to the development prospects of manifold learning, this paper describes four classical manifold learning methods and each advantages and disadvantages. It reviews the research status and application of fault diagnosis based on manifold learning, as well as future direction of researches in the field of manifold learning fault diagnosis.

Robust Image Representation via Low Rank Locality Preserving Projection

2021 ◽  
Vol 15 (4) ◽  
pp. 1-22
Author(s):  
Shuai Yin ◽  
Yanfeng Sun ◽  
Junbin Gao ◽  
Yongli Hu ◽  
Boyue Wang ◽  
...  
Keyword(s):  
Original Data ◽  
Low Rank ◽  
Public Image ◽  
Noise Component ◽  
Locality Preserving Projection ◽  
Locality Preserving ◽  
Robust Image ◽  
Projective Matrix ◽  
Low Dimensional ◽  
Intrinsic Component

Locality preserving projection (LPP) is a dimensionality reduction algorithm preserving the neighhorhood graph structure of data. However, the conventional LPP is sensitive to outliers existing in data. This article proposes a novel low-rank LPP model called LR-LPP. In this new model, original data are decomposed into the clean intrinsic component and noise component. Then the projective matrix is learned based on the clean intrinsic component which is encoded in low-rank features. The noise component is constrained by the ℓ 1 -norm which is more robust to outliers. Finally, LR-LPP model is extended to LR-FLPP in which low-dimensional feature is measured by F-norm. LR-FLPP will reduce aggregated error and weaken the effect of outliers, which will make the proposed LR-FLPP even more robust for outliers. The experimental results on public image databases demonstrate the effectiveness of the proposed LR-LPP and LR-FLPP.

scholarly journals Nonlinear Feature Extraction Through Manifold Learning in an Electronic Tongue Classification Task

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4834
Author(s):  
Jersson X. Leon-Medina ◽  
Maribel Anaya ◽  
Francesc Pozo ◽  
Diego Tibaduiza
Keyword(s):  
Feature Extraction ◽  
Manifold Learning ◽  
Classification Accuracy ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Electronic Tongue ◽  
Locally Linear Embedding ◽  
Data Set ◽  
Nonlinear Feature Extraction ◽  
Nonlinear Feature

A nonlinear feature extraction-based approach using manifold learning algorithms is developed in order to improve the classification accuracy in an electronic tongue sensor array. The developed signal processing methodology is composed of four stages: data unfolding, scaling, feature extraction, and classification. This study aims to compare seven manifold learning algorithms: Isomap, Laplacian Eigenmaps, Locally Linear Embedding (LLE), modified LLE, Hessian LLE, Local Tangent Space Alignment (LTSA), and t-Distributed Stochastic Neighbor Embedding (t-SNE) to find the best classification accuracy in a multifrequency large-amplitude pulse voltammetry electronic tongue. A sensitivity study of the parameters of each manifold learning algorithm is also included. A data set of seven different aqueous matrices is used to validate the proposed data processing methodology. A leave-one-out cross validation was employed in 63 samples. The best accuracy (96.83%) was obtained when the methodology uses Mean-Centered Group Scaling (MCGS) for data normalization, the t-SNE algorithm for feature extraction, and k-nearest neighbors (kNN) as classifier.

scholarly journals Robust Semi-Supervised Manifold Learning Algorithm for Classification

2018 ◽  
Vol 2018 ◽  
pp. 1-8 ◽  
Author(s):  
Mingxia Chen ◽  
Jing Wang ◽  
Xueqing Li ◽  
Xiaolong Sun
Keyword(s):  
Manifold Learning ◽  
Optimization Model ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Data Sets ◽  
Regularization Term ◽  
Partially Labeled Data ◽  
Label Information ◽  
Low Dimensional ◽  
The Impact

In the recent years, manifold learning methods have been widely used in data classification to tackle the curse of dimensionality problem, since they can discover the potential intrinsic low-dimensional structures of the high-dimensional data. Given partially labeled data, the semi-supervised manifold learning algorithms are proposed to predict the labels of the unlabeled points, taking into account label information. However, these semi-supervised manifold learning algorithms are not robust against noisy points, especially when the labeled data contain noise. In this paper, we propose a framework for robust semi-supervised manifold learning (RSSML) to address this problem. The noisy levels of the labeled points are firstly predicted, and then a regularization term is constructed to reduce the impact of labeled points containing noise. A new robust semi-supervised optimization model is proposed by adding the regularization term to the traditional semi-supervised optimization model. Numerical experiments are given to show the improvement and efficiency of RSSML on noisy data sets.

scholarly journals Nonlocal Estimation of Manifold Structure

2006 ◽  
Vol 18 (10) ◽  
pp. 2509-2528 ◽  
Author(s):  
Yoshua Bengio ◽  
Martin Monperrus ◽  
Hugo Larochelle
Keyword(s):  
Large Class ◽  
Manifold Learning ◽  
Learning Algorithms ◽  
Tangent Plane ◽  
Training Data ◽  
Kernel Learning ◽  
Manifold Structure ◽  
Prediction Function ◽  
Underlying Manifold ◽  
Shared Structure

We claim and present arguments to the effect that a large class of manifold learning algorithms that are essentially local and can be framed as kernel learning algorithms will suffer from the curse of dimensionality, at the dimension of the true underlying manifold. This observation invites an exploration of nonlocal manifold learning algorithms that attempt to discover shared structure in the tangent planes at different positions. A training criterion for such an algorithm is proposed, and experiments estimating a tangent plane prediction function are presented, showing its advantages with respect to local manifold learning algorithms: it is able to generalize very far from training data (on learning handwritten character image rotations), where local nonparametric methods fail.

Novel Convolutional Restricted Boltzmann Machine manifold learning inspired dynamic user clustering hybrid precoding for millimeter-wave massive multiple-input multiple-output systems

2021 ◽  
Vol 17 (11) ◽  
pp. 155014772110553
Author(s):  
Xiaoping Zhou ◽  
Haichao Liu ◽  
Bin Wang ◽  
Qian Zhang ◽  
Yang Wang
Keyword(s):  
Millimeter Wave ◽  
Manifold Learning ◽  
Multiple Input Multiple Output ◽  
Restricted Boltzmann Machine ◽  
Boltzmann Machine ◽  
Hybrid Precoding ◽  
User Clustering ◽  
Multiple Input ◽  
Input Multiple Output ◽  
Low Dimensional

Millimeter-wave massive multiple-input multiple-output is a key technology in 5G communication system. In particular, the hybrid precoding method has the advantages of being power efficient and less expensive than the full-digital precoding method, so it has attracted more and more attention. The effectiveness of this method in simple systems has been well verified, but its performance is still unknown due to many problems in real communication such as interference from other users and base stations, and users are constantly on the move. In this article, we propose a dynamic user clustering hybrid precoding method in the high-dimensional millimeter-wave multiple-input multiple-output system, which uses low-dimensional manifolds to avoid complicated calculations when there are many antennas. We model each user set as a novel Convolutional Restricted Boltzmann Machine manifold, and the problem is transformed into cluster-oriented multi-manifold learning. The novel Convolutional Restricted Boltzmann Machine manifold learning seeks to learn embedded low-dimensional manifolds through manifold learning in the face of user mobility in clusters. Through proper user clustering, the hybrid precoding is investigated for the sum-rate maximization problem by manifold quasi-conjugate gradient methods. This algorithm avoids the traditional method of processing high-dimensional channel parameters, achieves a high signal-to-noise ratio, and reduces computational complexity. The simulation result table shows that this method can get almost the best summation rate and higher spectral efficiency compared with the traditional method.

Sign in / Sign up

Export Citation Format

Share Document