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

Authors: Lin Liang; Fei Liu; Maolin Li; Guanghua Xu
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

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.


---

## Body

## 1. Introduction

Rotating machinery covers a wide range of mechanical equipment and is of importance in industrial applications. Therefore, faults in rotating machinery may severely affect operations in industry and even safety. To minimize the number of breakdowns as well as to increase the reliability, rotating machinery condition should be monitored for symptoms and incipient fault detection. By this, the life of machinery could be prolonged and the catastrophic consequences of unplanned failure could be avoided. Traditionally, to monitor the conditions and diagnose the faults of rotating machinery, vibration signals are most selected due to its easy-to-measure characteristics and analysis [1–4]. The process technologies of vibration signals in common use are frequency spectrum, axis center orbit, time-frequency analysis, and so on. However, for the nonlinear faults of rotating machinery, such as rubbing, pedestal looseness fluid, and so forth, there are still some problems, for example, the amplitude and phase information of vibration signals are separated from each other, and the correlation of the vibration signals on the vertical and horizontal direction cannot be obtained. Hence, it is difficult to recognize the panorama of the rotor’s vibration.To overcome the shortcomings of the traditional methods, the holospectrum was put forth for synthesizing the information of the phase, amplitude, and frequency [5]. As an effective fault diagnosis technology for the rotation machinery, it takes advantage of the improved Fourier transform algorithm to analyze the vibration displacement signals from one measuring section which can provide much more information about rotor vibration behavior. However, it needs artificial experience for better result. In case of holospectrum, it is unavoidable to select proper harmonic components for correct judgment. For example, for misalignment fault, the orbit of axis center of rotor is synthesized by 1x, 2x, and 4x frequency components, while the axis center orbit for oil whirl is built by 0.45x frequency component. That is to say, that the method failed to deal with the vibration data without manual intervention.Due to instantaneous variations in friction, damping, and load, the mechanical systems are often characterized by nonlinear behaviors. Therefore, nonlinear analysis methods provide a good choice to extract defect-related features hidden in the measured signals, which may not be effectively identified using the conventional methods. Many nonlinear methods, such as correlation dimension, Lyapunov exponent, and approximate entropy [6], have been investigated. These methods are suitable to reveal the variations of the dynamical system where it is in the noise-free or low noise conditions. In fact, the vibration signals obtained from the mechanical system are inevitably contaminated by noise. Thus the above methods are conducted by averaging all points in the embedding space, and this may lose significant information about the time domain.As a new dimension reduction technique, manifold learning methods have emerged in nonlinear research fields to identify meaningful low-dimensional structures hidden in high-dimensional observations, such as locally linear embedding [7], isometric feature mapping [8], and local tangent space alignment [9]. These methods have been applied in computer vision, document analysis, and fault diagnosis [10–12]. Yang et al. [13] proposed a method for nonlinear time series noise reduction based on principal manifold learning applied to the analysis of gearbox vibration signal with tooth broken. Li et al. [14] proposed the multiple manifolds analysis approach to extract manifold information from the bearing vibration signals with different faults. As for rotor systems, Jiang et al. [15] recently proposed the supervised manifold learning algorithm for effective feature extraction. Based on the survey of methods above, it is found that the manifold learning is an effective method for feature extraction. However, the features are extracted usually in uniform distribution of sample data, ignoring the influence of neighborhood size.Obviously, neighborhood of high dimension constructed with vibration signal can not ensure uniform distribution. Same neighborhoods size can falsely estimate the relationships between the neighbors; it is therefore worthy of considering variable number of neighbors that are adaptively chosen. In order to distinguish the nonlinear fault of rotating machinery with vibration signals, a new low-dimensional embedding extraction method based on the local tangent space alignment combined with self-organization mapping is proposed. The main advantages of the approach, compared with other nonlinear analysis methods, are as follows: vibration signals are embedded into a high-dimensional space, which is more effective to discover the essential characteristics of the dynamical system, and it can distinguish the type of faults with less manual intervention. In a word, the new approach extracts the low-dimensional embedding from the manifolds to reflect the states of the mechanical system rather than extract a feature by averaging all points with the time waveform.The organization of the rest paper is given as follows: a brief introduction of manifold learning with self-organizing mapping is given in Section2. In Section 3, the details of feature extraction scheme are proposed. And Section 4 applies the method in detection for nonlinear fault of rotating machine. Finally, conclusions are drawn in Section 5.


## 2. Manifold Learning with Self-Organizing Mapping

### 2.1. Adaptive Selection of Neighborhood

Obviously, large neighborhoods cause confusions when dealing with the highly twisted manifold. In contrast, small neighborhoods can falsely estimate the relationships between the neighbors. Thinking to added noise, the distribution of samples in feature space is usually nonuniform. Thus, the fixed sizes of neighborhoods cannot satisfy the changing manifold structures. It is inevitable that the neighborhood size should be selected adaptively with the principle that all of subspaces should be connected to construct the topology structure of manifold. Meanwhile, there should be enough overlaps between adjacent neighbors, in order to transmit the local information.From the view of network, self-organizing mapping (SOM) has the ability to divide nodes adaptively. Using competing-layer neurons to match the center of local neighbors of manifold structures, node grids are organized to cover the topological structures. Then with the learning of SOM, the local neighbors of high-dimensional manifolds are divided adaptively.


### 2.2. Self-Organizing Mapping with EM

A SOM is a type of artificial neural network that is trained using unsupervised learning to produce a low-dimensional mapping space, discretized representation of the input space of training samples, and a self-organizing mapping consists of components called nodes. Associated with each node is a weight vector of the same dimension as the input data vectors, and a position in the mapping space.Letp
r
i denote the probability that input x
i is assigned to the node with weight w
r. It is constrained by ∑
r
p
r
i
=
1 and p
r
i
>
0. There is a neighborhood function h
r
,
s that corresponds to the control strength between node r and node s. Usually, it is a decreasing function of the distance between nodes r and s. Given the data X, the optimal goal is to find the probability assignments P and weights W that minimizes (1)
F
q
P
,
W
=
∑
i
∑
r
p
r
i
∑
s
h
r
,
s
D
x
i
,
w
s
,where d
(
r
,
s
) is the distance between nodes of network and D is the distance between inputs X and weights W.The closer the distance between the nodes, the smallerh
r
,
s value. So the logarithm likelihood function is defined as follows:(2)
F
ε
P
=
∑
i
∑
r
p
r
i
log
⁡
⁡
p
r
i
q
r
,where q
r is priori probability distribution and its initial value is usually set to uniform distribution. Then plusing (1) into (2), the free energy function is now the following:(3)
F
P
,
W
=
F
q
P
,
W
+
F
ε
P
.To minimizeF
(
P
,
W
) of constraint conditions, the implementation process of SOM can be viewed as in the condition of known data X, seeking P and W posterior distribution density function. Obviously, it is suitable to select neighborhood with EM iteration [16]. Therefore, the neighborhood selection algorithm is as follows.(1)
Calculate the neighborhood matrix of topology network in initial output layerH
=
[
h
s
1
,
…
,
h
s
r
] and normalize it. Neighborhood function is given by(4)
h
r
,
s
=
exp
⁡
-
d
r
,
s
2
2
σ
2
,
whered
(
r
,
s
) is the distance between nodes of network. Set the initial value: s
=
1
,
2
,
…
,
r and σ
=
r; thus the sum of the relative entropy in initial competitive layer network is defined as(5)
e
i
=
∑
p
=
1
q
-
h
i
p
*
log
⁡
h
i
p
.
The initial weight matrixW is given by W
=
diag
(
(
∑
q
Q
)
-
1
)
*
Q
*
X, where Q
=
[
q
1
,
…
,
q
r
] and q
i is a random value between 1 and r.
(2)
The location coordinate of topology node is set to the element of weightW. Then function F is calculated as(6)
F
=
-
(
∑
1
r
D
·
Q
′
)
2
σ
+
e
i
′
W
e
-
D
*
log
⁡
σ
2
=
f
1
,
f
2
,
…
,
f
N
,
whereσ
=
∑
i
=
1
N
min
⁡
(
d
i
) and e is the sum of relative entropy in competition layer network. D is the distance between inputs X and weights W, where D
=
X
-
W
=
[
d
1
,
d
2
,
…
,
d
q
]. The global optimal unit is d
j
=
min
⁡
(
d
1
,
d
2
,
…
,
d
r
) in which j is set to the winner neurons index for input x
i.
(3)
With the iterate minimal,F is found by(7)
f
i
new
=
f
i
i
=
j
-
∑
1
r
D
i
·
h
i
2
σ
+
e
i
′
i
-
D
*
log
⁡
σ
2
i
≠
j
.
The nodes which are greater thanf
i can be found in f
i
new and are labeled with v. So the node distribution is adjusted with(8)
q
new
=
v
.
(4)
Seth
new
=
h
*
r
a
t
e, in whichrate is learning ratio. Then new e, Q, W, F
, and σ are calculated, and return to Step (3) until the elements in theH are big enough. Finally, with the above iteration, the weightW is calculated and then fixed in the maximization for the new value.


### 2.3. Manifold Learning with SOM

Manifold learning aims at discovering the intrinsic structure of nonlinear date. The process of the manifold learning with SOM is shown in Figure1, and the implementation procedures are detailed as follows.(1)
Given a set of inputsX, the SOM network is adopted to optimize the weights W. Including multifrequency components or noise in vibration signals, obviously, the performance of the trajectory in phase space reconstruction is complex. Therefore, to balance the calculation and efficiency, network size is usually set to a larger scale. Meanwhile, to keep the consistency optimal results, initial weight of W can be set to unit matrix, and the learning ratio of H is also set to 1.1 for a gradual learning process.
(2)
Selecting neighborhood adaptively: each element ofW is used to set the center node of local neighbors. To ensure enough overlap, the radius of neighbor is equal to the half of maximal distance between center nodes. According to radius of neighbor, the local neighbors X
i are selected, where i
=
1,2
,
…
,
k and k is the number of topology grids.
(3)
Extracting local information: compute thed largest eigenvectors g
1
,
…
,
g
d of the correlation matrix (
X
i
-
X
-
i
e
T
)
T
(
X
i
-
X
-
i
e
T
), and set G
i
=
[
e
/
k
,
g
1
,
…
,
g
d
], where X
-
i is the mean of X
i.
(4)
Constructing alignment matrix: form the matrixB by locally summing B
(
X
-
i
,
X
-
i
)
←
B
(
X
-
i
,
X
-
i
)
+
B
i if a direct eigensolver will be used. Otherwise implement a routine that computes matrix-vector multiplication B for an arbitrary vector u.
(5)
Aligning global coordinates: compute thed
+
1 smallest eigenvectors of B and pick up the eigenvector matrix (
u
2
,
u
3
,
…
,
u
d
+
1
) corresponding to the 2nd to d + 1st smallest eigenvalues, and set the global coordinates T
=
u
2
,
u
3
,
…
,
u
d
+
1
T. With the global coordinates, the feature can be reflected in low-dimension spaces T.Figure 1
Schematic diagram of the proposed manifold learning with SOM method.From the viewpoint of geometry, the vibration data of the same operation state of rotor system has the same geometric property in space distribution or topological structure, its mapping points in the low-dimension embedding space can be distributed in embedded manifolds or in its neighbor. However the embedding dimensiond of manifold has relation with(9)
d
=
m
min
⁡
,where m
min
⁡ is the minimum embedding of dynamics system and is estimated with Cao algorithm [17].Based on the adaptive neighborhood selection, the low-dimensional embedding can be extracted effectively. Since node neighborhood is divided adaptively by the grid of network for competition mechanism, SOM can overcome the limitation of fixed neighborhood algorithms.


## 2.1. Adaptive Selection of Neighborhood

Obviously, large neighborhoods cause confusions when dealing with the highly twisted manifold. In contrast, small neighborhoods can falsely estimate the relationships between the neighbors. Thinking to added noise, the distribution of samples in feature space is usually nonuniform. Thus, the fixed sizes of neighborhoods cannot satisfy the changing manifold structures. It is inevitable that the neighborhood size should be selected adaptively with the principle that all of subspaces should be connected to construct the topology structure of manifold. Meanwhile, there should be enough overlaps between adjacent neighbors, in order to transmit the local information.From the view of network, self-organizing mapping (SOM) has the ability to divide nodes adaptively. Using competing-layer neurons to match the center of local neighbors of manifold structures, node grids are organized to cover the topological structures. Then with the learning of SOM, the local neighbors of high-dimensional manifolds are divided adaptively.


## 2.2. Self-Organizing Mapping with EM

A SOM is a type of artificial neural network that is trained using unsupervised learning to produce a low-dimensional mapping space, discretized representation of the input space of training samples, and a self-organizing mapping consists of components called nodes. Associated with each node is a weight vector of the same dimension as the input data vectors, and a position in the mapping space.Letp
r
i denote the probability that input x
i is assigned to the node with weight w
r. It is constrained by ∑
r
p
r
i
=
1 and p
r
i
>
0. There is a neighborhood function h
r
,
s that corresponds to the control strength between node r and node s. Usually, it is a decreasing function of the distance between nodes r and s. Given the data X, the optimal goal is to find the probability assignments P and weights W that minimizes (1)
F
q
P
,
W
=
∑
i
∑
r
p
r
i
∑
s
h
r
,
s
D
x
i
,
w
s
,where d
(
r
,
s
) is the distance between nodes of network and D is the distance between inputs X and weights W.The closer the distance between the nodes, the smallerh
r
,
s value. So the logarithm likelihood function is defined as follows:(2)
F
ε
P
=
∑
i
∑
r
p
r
i
log
⁡
⁡
p
r
i
q
r
,where q
r is priori probability distribution and its initial value is usually set to uniform distribution. Then plusing (1) into (2), the free energy function is now the following:(3)
F
P
,
W
=
F
q
P
,
W
+
F
ε
P
.To minimizeF
(
P
,
W
) of constraint conditions, the implementation process of SOM can be viewed as in the condition of known data X, seeking P and W posterior distribution density function. Obviously, it is suitable to select neighborhood with EM iteration [16]. Therefore, the neighborhood selection algorithm is as follows.(1)
Calculate the neighborhood matrix of topology network in initial output layerH
=
[
h
s
1
,
…
,
h
s
r
] and normalize it. Neighborhood function is given by(4)
h
r
,
s
=
exp
⁡
-
d
r
,
s
2
2
σ
2
,
whered
(
r
,
s
) is the distance between nodes of network. Set the initial value: s
=
1
,
2
,
…
,
r and σ
=
r; thus the sum of the relative entropy in initial competitive layer network is defined as(5)
e
i
=
∑
p
=
1
q
-
h
i
p
*
log
⁡
h
i
p
.
The initial weight matrixW is given by W
=
diag
(
(
∑
q
Q
)
-
1
)
*
Q
*
X, where Q
=
[
q
1
,
…
,
q
r
] and q
i is a random value between 1 and r.
(2)
The location coordinate of topology node is set to the element of weightW. Then function F is calculated as(6)
F
=
-
(
∑
1
r
D
·
Q
′
)
2
σ
+
e
i
′
W
e
-
D
*
log
⁡
σ
2
=
f
1
,
f
2
,
…
,
f
N
,
whereσ
=
∑
i
=
1
N
min
⁡
(
d
i
) and e is the sum of relative entropy in competition layer network. D is the distance between inputs X and weights W, where D
=
X
-
W
=
[
d
1
,
d
2
,
…
,
d
q
]. The global optimal unit is d
j
=
min
⁡
(
d
1
,
d
2
,
…
,
d
r
) in which j is set to the winner neurons index for input x
i.
(3)
With the iterate minimal,F is found by(7)
f
i
new
=
f
i
i
=
j
-
∑
1
r
D
i
·
h
i
2
σ
+
e
i
′
i
-
D
*
log
⁡
σ
2
i
≠
j
.
The nodes which are greater thanf
i can be found in f
i
new and are labeled with v. So the node distribution is adjusted with(8)
q
new
=
v
.
(4)
Seth
new
=
h
*
r
a
t
e, in whichrate is learning ratio. Then new e, Q, W, F
, and σ are calculated, and return to Step (3) until the elements in theH are big enough. Finally, with the above iteration, the weightW is calculated and then fixed in the maximization for the new value.


## 2.3. Manifold Learning with SOM

Manifold learning aims at discovering the intrinsic structure of nonlinear date. The process of the manifold learning with SOM is shown in Figure1, and the implementation procedures are detailed as follows.(1)
Given a set of inputsX, the SOM network is adopted to optimize the weights W. Including multifrequency components or noise in vibration signals, obviously, the performance of the trajectory in phase space reconstruction is complex. Therefore, to balance the calculation and efficiency, network size is usually set to a larger scale. Meanwhile, to keep the consistency optimal results, initial weight of W can be set to unit matrix, and the learning ratio of H is also set to 1.1 for a gradual learning process.
(2)
Selecting neighborhood adaptively: each element ofW is used to set the center node of local neighbors. To ensure enough overlap, the radius of neighbor is equal to the half of maximal distance between center nodes. According to radius of neighbor, the local neighbors X
i are selected, where i
=
1,2
,
…
,
k and k is the number of topology grids.
(3)
Extracting local information: compute thed largest eigenvectors g
1
,
…
,
g
d of the correlation matrix (
X
i
-
X
-
i
e
T
)
T
(
X
i
-
X
-
i
e
T
), and set G
i
=
[
e
/
k
,
g
1
,
…
,
g
d
], where X
-
i is the mean of X
i.
(4)
Constructing alignment matrix: form the matrixB by locally summing B
(
X
-
i
,
X
-
i
)
←
B
(
X
-
i
,
X
-
i
)
+
B
i if a direct eigensolver will be used. Otherwise implement a routine that computes matrix-vector multiplication B for an arbitrary vector u.
(5)
Aligning global coordinates: compute thed
+
1 smallest eigenvectors of B and pick up the eigenvector matrix (
u
2
,
u
3
,
…
,
u
d
+
1
) corresponding to the 2nd to d + 1st smallest eigenvalues, and set the global coordinates T
=
u
2
,
u
3
,
…
,
u
d
+
1
T. With the global coordinates, the feature can be reflected in low-dimension spaces T.Figure 1
Schematic diagram of the proposed manifold learning with SOM method.From the viewpoint of geometry, the vibration data of the same operation state of rotor system has the same geometric property in space distribution or topological structure, its mapping points in the low-dimension embedding space can be distributed in embedded manifolds or in its neighbor. However the embedding dimensiond of manifold has relation with(9)
d
=
m
min
⁡
,where m
min
⁡ is the minimum embedding of dynamics system and is estimated with Cao algorithm [17].Based on the adaptive neighborhood selection, the low-dimensional embedding can be extracted effectively. Since node neighborhood is divided adaptively by the grid of network for competition mechanism, SOM can overcome the limitation of fixed neighborhood algorithms.


## 3. Schematic Diagram of Feature Extraction

### 3.1. Manifold Reconstruction from Vibration Signal

The state space is constructed by a set of basis vectors which are composed of the dynamic variables of a system. But most commonly, not all the dynamic variables of the system are accessible for measure, an alternative form known as embedded phase space is convenient for research of the dynamics of the system. Suppose measurements obtained through sampling can be defined byx
n. In order to reconstruct a manifold from a time series, time delay embedding [18] is employed. For a time series X
=
[
x
1
,
x
2
,
…
x
N
], the delay vectors in the embedded phase space are given as(10)
Y
i
=
x
i
,
x
i
+
τ
,
…
,
x
i
+
m
-
1
τ
,where i
=
1,2
,
…
,
N
,
m is the embedding dimension and τ is the delay time.Roughly speaking,m-dimensional delay embedding space is equivalent to the original observed state space of the dynamical system. Taking the steady-state response of the variable x and performing the time delay embedding transformation lead to trajectories in the embedding space that comprises a geometric manifold object. Takens has shown that [19], using delay coordinates and the embedding procedure, a manifold can be reconstructed by embedding a time series into a high-dimensional space, in which the topological structure and nonlinear characteristics hidden in the one-dimensional time series can be easily extracted. Thus, reconstructing a manifold in a high-dimensional space is the key to the proposed approach in this paper.However, the selection of time delay and embedding dimension in the phase space reconstruction is a question. Except for uniform time delay, the nonuniform time delay is also used to build the phase space [20]. But it is well known that even nonuniform time delay also cannot guarantee that the time delay vectors distribution is uniform. So, in order to simplify the problem, the Hankel matrix is adopted in this paper to represent the high-dimensional space, where τ
=
1 and embedding dimension m is large enough. Namely, if m
≫
m
min
⁡ where m
min
⁡ is the minimum embedding, it is possible to reconstruct the underlying dynamic structure of the entire system from the behavior of the single variable.


### 3.2. Schematic Diagram

For feature extraction in rotating machinery fault diagnosis, the manifold learning with SOM is adopted to explore the geometric distribution properties embedded in the high-dimensional space. On the basis of the principles above, a new approach of feature extraction method based on adaptive manifold learning is proposed. First, high-dimensional observation space is built with phase space reconstruction, and then map the space phase data into a feature space, and estimate the intrinsic distribution of samples to gain the embedding manifold structure. Finally, the feature is represented by two dimensional projections for the sake of intuitive analyses of equipment operating status. The schematic diagram of the feature extraction method based on manifold learning is shown in Figure2.Figure 2
Schematic diagram of feature extraction strategy.In application, it is should be noted that the holospectrum is drawn from the different harmonic components depending on manual intervention. Instead of by frequency component selection, signal is directly used to construct the dynamic trajectory with phase space reconstruction, and then through adaptive neighborhood selection strategy, embedding low-dimensional manifold can be extracted, therefore, reducing the dependence on human experience.


## 3.1. Manifold Reconstruction from Vibration Signal

The state space is constructed by a set of basis vectors which are composed of the dynamic variables of a system. But most commonly, not all the dynamic variables of the system are accessible for measure, an alternative form known as embedded phase space is convenient for research of the dynamics of the system. Suppose measurements obtained through sampling can be defined byx
n. In order to reconstruct a manifold from a time series, time delay embedding [18] is employed. For a time series X
=
[
x
1
,
x
2
,
…
x
N
], the delay vectors in the embedded phase space are given as(10)
Y
i
=
x
i
,
x
i
+
τ
,
…
,
x
i
+
m
-
1
τ
,where i
=
1,2
,
…
,
N
,
m is the embedding dimension and τ is the delay time.Roughly speaking,m-dimensional delay embedding space is equivalent to the original observed state space of the dynamical system. Taking the steady-state response of the variable x and performing the time delay embedding transformation lead to trajectories in the embedding space that comprises a geometric manifold object. Takens has shown that [19], using delay coordinates and the embedding procedure, a manifold can be reconstructed by embedding a time series into a high-dimensional space, in which the topological structure and nonlinear characteristics hidden in the one-dimensional time series can be easily extracted. Thus, reconstructing a manifold in a high-dimensional space is the key to the proposed approach in this paper.However, the selection of time delay and embedding dimension in the phase space reconstruction is a question. Except for uniform time delay, the nonuniform time delay is also used to build the phase space [20]. But it is well known that even nonuniform time delay also cannot guarantee that the time delay vectors distribution is uniform. So, in order to simplify the problem, the Hankel matrix is adopted in this paper to represent the high-dimensional space, where τ
=
1 and embedding dimension m is large enough. Namely, if m
≫
m
min
⁡ where m
min
⁡ is the minimum embedding, it is possible to reconstruct the underlying dynamic structure of the entire system from the behavior of the single variable.


## 3.2. Schematic Diagram

For feature extraction in rotating machinery fault diagnosis, the manifold learning with SOM is adopted to explore the geometric distribution properties embedded in the high-dimensional space. On the basis of the principles above, a new approach of feature extraction method based on adaptive manifold learning is proposed. First, high-dimensional observation space is built with phase space reconstruction, and then map the space phase data into a feature space, and estimate the intrinsic distribution of samples to gain the embedding manifold structure. Finally, the feature is represented by two dimensional projections for the sake of intuitive analyses of equipment operating status. The schematic diagram of the feature extraction method based on manifold learning is shown in Figure2.Figure 2
Schematic diagram of feature extraction strategy.In application, it is should be noted that the holospectrum is drawn from the different harmonic components depending on manual intervention. Instead of by frequency component selection, signal is directly used to construct the dynamic trajectory with phase space reconstruction, and then through adaptive neighborhood selection strategy, embedding low-dimensional manifold can be extracted, therefore, reducing the dependence on human experience.


## 4. Experiments Verifications

To verify the capability of feature extraction of the proposed method, the nonlinear Lorenz system was adopted for test and is described as(11)
d
x
d
t
=
α
y
-
x
,
d
y
d
t
=
γ
-
z
x
-
y
,
d
z
d
t
=
x
y
-
β
z
,where the parameters α
=
16, β
=
4, γ
=
45.92, and the 8 dB white noise was also mixed. According to the evaluation index proposed in Cao algorithm, the E
1
(
m
) and E
2
(
m
) curve were calculated, respectively, where the time delay τ
=
1. The result is shown in Figure 3.Figure 3
E
1
(
m
) and E
2
(
m
) curve of the Lorenz system.In manifold learning, the minimum embedding dimension is set to 3. The two dimensional projection of the phase space is shown in Figure4, where embedding dimension m of Hankel matrix is set to 30. Due to the mixed noise, the dynamics trajectory is difficult to be identified. The two dimensional projection of Lorenz system extracted by the proposed manifold learning technique is shown in Figure 5. It is found that the embedding manifold structure is similar to the Lorenz system.Figure 4
Phase space of Lorenz system with added noise.Figure 5
Embedding projection of manifold learning with SOM.With the EM iteration, the neighborhood sizes learned from the SOM are shown in Figure6. It is easy to figure out that the neighborhood sizes of nodes fluctuate are between 4 and 78. For the comparison, the adaptive neighborhood selection algorithm is also used to extract the low-dimension embedding using the neighborhood contraction and expansion [21]. The two dimensional projection is displayed in Figure 7. Comparing to Figure 5, it is noted that projection of the reconstructed phase space has a certain deform, because the coefficient selection of contraction and expansion of neighborhood depend on artificial experience. Due to the fewer parameters selection, it clearly shows SOM technique has the better ability in extracting features.Figure 6
Neighborhood size learned from SOM.Figure 7
Embedding projection of manifold learning with adaptive neighborhood selection.


## 5. Application

The proposed method is applied to feature extraction of rotating mechanical nonlinear faults. Firstly, the fluid excitation failure in a N2 compressor high-pressure cylinder of petrochemical plant is adopted to extract feature. Usually, for the normal operation of rotation machinery, due to the laminar flow state of fluid medium through flow of rotor, the vibration of machinery is smaller. However, inappropriate adjustment of process parameters can lead to the steady turbulent flow phenomenon, resulting in the impact on the rotor. The compressor rotating speed is 11 416 r/min. Displacement transducers were used to acquire vibration signals of the rotor at the corresponding measurement points on coupling end. The sampling frequency is 2 000 Hz, and vibration waveform and frequency spectrum are shown in Figures8 and 9, respectively. In Figure 9, except for the rotation frequency 190.3 Hz, there are large numbers of low frequency noise components. Therefore, the original axis center orbit plotted in Figure 10 is submerged. In order to eliminate the noise, the band-pass filter with phase preserving is used, and the corresponding filtering axis center orbit is also shown in Figure 11. According to the mechanism of fluid excitation fault, the typical performance of axis center orbit is unstable ellipse. However, due to its worse performance of filtering axis center orbit for fluid excitation fault, it is not easy to identify the fault pattern accurately.Figure 8
Vibration waveform of fluid excitation fault.Figure 9
Frequency spectrum of fluid excitation fault.Figure 10
Raw axis center orbit of fluid excitation fault.Figure 11
Filtering axis center orbit of fluid excitation fault.As a comparison, the proposed method is adopted to extract embedding manifold from the collected vibration data. TheE
1
(
m
) and E
2
(
m
) curve were calculated and shown in Figure 12, and the minimum embedding dimension is set to 6. In corresponding 6 embedding vectors extracted with m
=
30, there are three kinds of frequency spectrum structure shown in Figures 13–15. It is clear that, comparing with Figure 9, the rotation frequency and low frequency noise components are separated effectively. Therefore the projection space of embedding manifold corresponding rotation frequency is displayed in Figure 16.Figure 12
E
1
(
m
) and E
2
(
m
) curve of fluid excitation fault.Figure 13
Frequency spectrum of the first embedding.Figure 14
Frequency spectrum of the third embedding.Figure 15
Frequency spectrum of the fifth embedding.Figure 16
Embedding projection of manifold learning with SOM.It is very convenient to identify that, due to fluid excitation through flow of rotor, the projection trajectory are an unstable ellipse trace characteristic that is different from other faults. So, according to the special curve of the embedded manifold, the fault can be identified effectively. Obviously, the axis center orbit shown in Figure11 has a certain limitation to identify this fault.In order to verify the capability of the proposed method, different neighborhood sizes were adopted by LTSA to extract the low-dimensional embedding, where the neighborhood sizek is set to 10 and 30, respectively. The experimental results with different k are shown in Figures 17 and 18. It is clear that the projection trajectory of embedding manifold with fixed neighborhood size cannot reflect the feature structure of fluid excitation fault, and the projection results are not as good as proposed method displayed in Figure 16. Obviously, the SOM neighborhood selection is more effective than the fixed neighborhood size. In addition, the other adaptive neighborhoods selection in manifold learning is also used to extract the low-dimension embedding, and the two dimensional projection is displayed in Figure 19. It is noted that although projection effect of the low-dimensional embedding is better than fixed neighborhood size, it is not good as the proposed method.Figure 17
Embedding projection with LTSA ink
=
10.Figure 18
Embedding projection with LTSA ink
=
30.Figure 19
Projection of embedding manifold with adaptive neighborhood selection.Next, the rotor-stator rub fault of turbines in refinery plant is also adopted to be analyzed. It should be noted that, due to the motion interference between stator and rotor, the axis orbit of rub fault is extremely complex and often shows a sudden change in axis center orbit. However, considering the influence of noise, only in the case of large fault degree, the characteristics can be observed effectively. Figures20 and 21 are the waveform and frequency spectrum of rotor-stator rub, and corresponding purified trace is shown in Figure 22 where turbine rotating speed is 446 r/min and the sampling frequency is 200 Hz. Generally, each frequency component in frequency spectrum corresponds to a sinusoidal component. So different faults can be represented with eight major harmonic frequency components and four low frequency components, where these frequency components are usually extracted for diagnosis purpose. Thus, the rotation frequency and its harmonic components can be selected to reconstruct time domain waveform via inverse Fourier transform, and the purified axis center orbit also is drawn from the reconstructed signals in measuring section. The main purpose is to eliminate the noise of the original axis center orbit. As seen from Figure 22, it is difficult to identify fault through waveform or axis center orbit.Figure 20
Waveform of rotor-stator rub.Figure 21
Frequency spectrum of rotor-stator rub.Figure 22
Purified axis center orbit.According to the evaluation, the minimum embedding dimension is set to 4. In corresponding four embedding vectors, there are two kinds of frequency spectrum structure shown in Figure23. It is clear that the rotation frequency and its harmonic components are extracted in different embedding. So the projection of embedding manifold corresponding rotation frequency and high frequency is displayed in Figure 24. It can be obviously seen that, due to the influence of the high frequency components, there are some sudden changes in two projection trajectory. Comparing the purified axis center orbit, in the projection shown in Figure 24, the change of trajectory very clearly reflects the characteristics of the rub fault. Obviously, as a typical nonlinear fault, it can be identified in the low embedding space effectively.Figure 23
Frequency spectrum of embedding manifold extracted with proposed method.
(a)
Frequency spectrum of the first embedding
(b)
Frequency spectrum of the third embeddingFigure 24
Projection of embedding manifold of rotor-stator rub.
(a)
Projection space inT
1 and T
2 direction
(b)
Projection space inT
1 and T
3 directionIn order to further test the effectiveness of the proposed method, the fixed neighborhood size was adopted by LTSA to extract the low-dimensional embedding, wherek is set to 20. The experimental result is shown in Figures 25 and 26 and is the corresponding frequency spectrum of embedding manifold. Obviously, due to the small neighborhood size, the high frequency components are filtered in embedding as shown in Figure 26; therefore, the sudden change behavior cannot be reflected in the trajectory of low-dimension embedding. It is clear that the method with fixed neighborhood size cannot extract effective low-dimensional embedding; thus identification of fault is seriously affected by the worst projection orbit.Figure 25
Projection of embedding manifold with neighborhood sizek
=
20.
(a)
Projection space inT
1 and T
2 direction
(b)
Projection space inT
1 and T
3 directionFigure 26
Frequency spectrum of embedding manifold extracted with fixed neighborhood size.
(a)
Frequency spectrum of the first embedding
(b)
Frequency spectrum of the third embedding


## 6. Conclusions

In this paper, a novel method for feature extraction of rotating machinery based on nonlinear manifold learning with neighborhood selection adaptive is proposed. In order to detect the nonlinear faults with less manual intervention, a single-signal phase space reconstruction is adopted to construct the high-dimensional manifold, and the embedding is extracted by manifold learning with SOM.The proposed method is applied to nonlinear system simulation and vibration data of rotating machinery collected with different nonlinear faults. The experimental results illustrate that the new method is superior to the holospectrum methods in fault diagnosis. Even though the behavior of faults is nonlinear and complicated, the manifold method with the adaptive neighborhood selection has demonstrated its reliability in extracting fault features that are not accessible by axis center orbit.It should be noted that the existing feature extraction approaches in literatures also use holospectrum and axis center orbits, but they are unavoidable to select proper harmonic components for correct judgment. However, the proposed method can distinguish the faults with less manual intervention. Therefore, it has higher accuracy in fault diagnosis than the traditional methods.



---

*Source: 873905-2015-10-07.xml*