scholarly journals A Deep Regression Model with Low-Dimensional Feature Extraction for Multi-Parameter Manufacturing Quality Prediction

2020 ◽  
Vol 10 (7) ◽  
pp. 2522
Author(s):  
Jun Deng ◽  
Yun Bai ◽  
Chuan Li
Keyword(s):  
Feature Extraction ◽  
Manifold Learning ◽  
Percentage Error ◽  
Quality Prediction ◽  
Manufacturing Quality ◽  
Regression Framework ◽  
Nonlinear Technique ◽  
Low Dimensional ◽  
Parts Manufacturing ◽  
Learned Features

Manufacturing quality prediction can be used to design better parameters at an earlier production stage. However, in complex manufacturing processes, prediction performance is affected by multi-parameter inputs. To address this issue, a deep regression framework based on manifold learning (MDRN) is proposed in this paper. The multi-parameter inputs (i.e., high-dimensional information) were firstly analyzed using manifold learning (ML), which is an effective nonlinear technique for low-dimensional feature extraction that can enhance the representation of multi-parameter inputs and reduce calculation burdens. The features obtained through the ML were then learned by a deep learning architecture (DL). It can learn sufficient features of the pattern between manufacturing quality and the low-dimensional information in an unsupervised framework, which has been proven to be effective in many fields. Finally, the learned features were inputted into the regression network, and manufacturing quality predictions were made. One type (two cases) of machinery parts manufacturing system was investigated in order to estimate the performance of the proposed MDRN with three comparisons. The experiments showed that the MDRN overwhelmed all the peer methods in terms of mean absolute percentage error, root-mean-square error, and threshold statistics. Based on these results, we conclude that integrating the ML technique for dimension reduction and the DL technique for feature extraction can improve multi-parameter manufacturing quality predictions.

scholarly journals Manifold Learning with Self-Organizing Mapping for Feature Extraction of Nonlinear Faults in Rotating Machinery

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Lin Liang ◽  
Fei Liu ◽  
Maolin Li ◽  
Guanghua Xu
Keyword(s):  
Feature Extraction ◽  
Phase Space ◽  
Manifold Learning ◽  
Vibration Signal ◽  
Rotating Machinery ◽  
Self Organization ◽  
Iteration Algorithm ◽  
Alignment Algorithm ◽  
Machinery Condition Monitoring ◽  
Low Dimensional

A new method for extracting the low-dimensional feature automatically with self-organization mapping manifold is proposed for the detection of rotating mechanical nonlinear faults (such as rubbing, pedestal looseness). Under the phase space reconstructed by single vibration signal, the self-organization mapping (SOM) with expectation maximization iteration algorithm is used to divide the local neighborhoods adaptively without manual intervention. After that, the local tangent space alignment algorithm is adopted to compress the high-dimensional phase space into low-dimensional feature space. The proposed method takes advantages of the manifold learning in low-dimensional feature extraction and adaptive neighborhood construction of SOM and can extract intrinsic fault features of interest in two dimensional projection space. To evaluate the performance of the proposed method, the Lorenz system was simulated and rotation machinery with nonlinear faults was obtained for test purposes. Compared with the holospectrum approaches, the results reveal that the proposed method is superior in identifying faults and effective for rotating machinery condition monitoring.

scholarly journals SUPERVISED MANIFOLD-LEARNING ALGORITHM FOR POLSAR FEATURE EXTRACTION AND LULC CLASSIFICATION

2020 ◽  
Vol XLIII-B3-2020 ◽  
pp. 345-350
Author(s):  
W. Wang ◽  
Z. Tian ◽  
B. Tian ◽  
J. Zhang
Keyword(s):  
Feature Extraction ◽  
Manifold Learning ◽  
Spatial Information ◽  
Feature Space ◽  
Speckle Noise ◽  
Superior Performance ◽  
Svm Classifier ◽  
Tensor Algebra ◽  
Data Set ◽  
Low Dimensional

Abstract. In this paper, a supervised manifold-learning method is proposed for PolSAR feature extraction and classification. Based on the tensor algebra, the proposed method characterizes each pixel with a local neighbourhood centered at it, thereby combining the spatial and polarimetric information within the image. The inherent spatial information is beneficial to alleviate the influence of speckle noise and improve the stability of the extracted features. In addition, the label information of training samples is utilized in feature extraction, therefore the discriminability of different classes can be well preserved. The tensor discriminative locality alignment (TDLA) method is applied to find the multilinear transformation from the original feature space to the low-dimensional feature space. Based on the extracted features in the low-dimensional space, the SVM classifier is applied to achieve the final classification result. A real PolSAR data set acquired over San Francisco is adopted for performance evaluation. The experimental results show that the proposed method can not only improve the classification accuracy, but also alleviate the influence of speckle noise. In addition, the spatial details can be well preserved, demonstrating the superior performance of the proposed method.

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.

scholarly journals A REVIEW OF FEATURE EXTRACTION METHODS ON MACHINE LEARNING

2021 ◽  
Vol 6 (22) ◽  
pp. 51-59
Author(s):  
Mustazzihim Suhaidi ◽  
Rabiah Abdul Kadir ◽  
Sabrina Tiun
Keyword(s):  
Machine Learning ◽  
Feature Extraction ◽  
Feature Selection ◽  
Input Data ◽  
Feature Vector ◽  
Learning Algorithm ◽  
Extraction Methods ◽  
Machine Learning Algorithm ◽  
Learning Tasks ◽  
Low Dimensional

Extracting features from input data is vital for successful classification and machine learning tasks. Classification is the process of declaring an object into one of the predefined categories. Many different feature selection and feature extraction methods exist, and they are being widely used. Feature extraction, obviously, is a transformation of large input data into a low dimensional feature vector, which is an input to classification or a machine learning algorithm. The task of feature extraction has major challenges, which will be discussed in this paper. The challenge is to learn and extract knowledge from text datasets to make correct decisions. The objective of this paper is to give an overview of methods used in feature extraction for various applications, with a dataset containing a collection of texts taken from social media.

Learning Manifolds

2012 ◽  
pp. 374-402
Author(s):  
Diana Mateus ◽  
Christian Wachinger ◽  
Selen Atasoy ◽  
Loren Schwarz ◽  
Nassir Navab
Keyword(s):  
Manifold Learning ◽  
Domain Knowledge ◽  
Dimensional Space ◽  
Human Motion ◽  
Motion Modeling ◽  
Learning Methods ◽  
Data Representations ◽  
Non Linear ◽  
Data Points ◽  
Low Dimensional

Computer aided diagnosis is often confronted with processing and analyzing high dimensional data. One alternative to deal with such data is dimensionality reduction. This chapter focuses on manifold learning methods to create low dimensional data representations adapted to a given application. From pairwise non-linear relations between neighboring data-points, manifold learning algorithms first approximate the low dimensional manifold where data lives with a graph; then, they find a non-linear map to embed this graph into a low dimensional space. Since the explicit pairwise relations and the neighborhood system can be designed according to the application, manifold learning methods are very flexible and allow easy incorporation of domain knowledge. The authors describe different assumptions and design elements that are crucial to building successful low dimensional data representations with manifold learning for a variety of applications. In particular, they discuss examples for visualization, clustering, classification, registration, and human-motion modeling.

scholarly journals An Incremental Version of L-MVU for the Feature Extraction of MI-EEG

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Mingai Li ◽  
Hongwei Xi ◽  
Xiaoqing Zhu
Keyword(s):  
Feature Extraction ◽  
Extraction Method ◽  
Average Energy ◽  
High Dimensional ◽  
Dimensional Representation ◽  
Feature Extraction Method ◽  
Sample Data ◽  
Out Of Sample ◽  
Nonlinear Features ◽  
Low Dimensional

Due to the nonlinear and high-dimensional characteristics of motor imagery electroencephalography (MI-EEG), it can be challenging to get high online accuracy. As a nonlinear dimension reduction method, landmark maximum variance unfolding (L-MVU) can completely retain the nonlinear features of MI-EEG. However, L-MVU still requires considerable computation costs for out-of-sample data. An incremental version of L-MVU (denoted as IL-MVU) is proposed in this paper. The low-dimensional representation of the training data is generated by L-MVU. For each out-of-sample data, its nearest neighbors will be found in the high-dimensional training samples and the corresponding reconstruction weight matrix be calculated to generate its low-dimensional representation as well. IL-MVU is further combined with the dual-tree complex wavelet transform (DTCWT), which develops a hybrid feature extraction method (named as IL-MD). IL-MVU is applied to extract the nonlinear features of the specific subband signals, which are reconstructed by DTCWT and have the obvious event-related synchronization/event-related desynchronization phenomenon. The average energy features of α and β waves are calculated simultaneously. The two types of features are fused and are evaluated by a linear discriminant analysis classifier. Based on the two public datasets with 12 subjects, extensive experiments were conducted. The average recognition accuracies of 10-fold cross-validation are 92.50% on Dataset 3b and 88.13% on Dataset 2b, and they gain at least 1.43% and 3.45% improvement, respectively, compared to existing methods. The experimental results show that IL-MD can extract more accurate features with relatively lower consumption cost, and it also has better feature visualization and self-adaptive characteristics to subjects. The t-test results and Kappa values suggest the proposed feature extraction method reaches statistical significance and has high consistency in classification.

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 Semi-Supervised Manifold Alignment Using Parallel Deep Autoencoders

Algorithms ◽  
2019 ◽  
Vol 12 (9) ◽  
pp. 186
Author(s):  
Fayeem Aziz ◽  
Aaron S.W. Wong ◽  
Stephan Chalup
Keyword(s):  
Manifold Learning ◽  
Network Architecture ◽  
Image Data ◽  
High Dimensional ◽  
Double Pendulum ◽  
Manifold Alignment ◽  
Series Of Experiments ◽  
Underlying Manifold ◽  
Low Dimensional ◽  
Pendulum Dynamics

The aim of manifold learning is to extract low-dimensional manifolds from high-dimensional data. Manifold alignment is a variant of manifold learning that uses two or more datasets that are assumed to represent different high-dimensional representations of the same underlying manifold. Manifold alignment can be successful in detecting latent manifolds in cases where one version of the data alone is not sufficient to extract and establish a stable low-dimensional representation. The present study proposes a parallel deep autoencoder neural network architecture for manifold alignment and conducts a series of experiments using a protein-folding benchmark dataset and a suite of new datasets generated by simulating double-pendulum dynamics with underlying manifolds of dimensions 2, 3 and 4. The dimensionality and topological complexity of these latent manifolds are above those occurring in most previous studies. Our experimental results demonstrate that the parallel deep autoencoder performs in most cases better than the tested traditional methods of semi-supervised manifold alignment. We also show that the parallel deep autoencoder can process datasets of different input domains by aligning the manifolds extracted from kinematics parameters with those obtained from corresponding image data.

Sign in / Sign up

Export Citation Format

Share Document