# Rolling Element Bearing Performance Degradation Assessment Using Variational Mode Decomposition and Gath-Geva Clustering Time Series Segmentation

Authors: Yaolong Li; Hongru Li; Bing Wang; Hongqiang Gu
Journal: International Journal of Rotating Machinery
 (2017)

---

## Abstract

By focusing on the issue of rolling element bearing (REB) performance degradation assessment (PDA), a solution based on variational mode decomposition (VMD) and Gath-Geva clustering time series segmentation (GGCTSS) has been proposed. VMD is a new decomposition method. Since it is different from the recursive decomposition method, for example, empirical mode decomposition (EMD), local mean decomposition (LMD), and local characteristic-scale decomposition (LCD), VMD needs a priori parameters. In this paper, we will propose a method to optimize the parameters in VMD, namely, the number of decomposition modes and moderate bandwidth constraint, based on genetic algorithm. Executing VMD with the acquired parameters, the BLIMFs are obtained. By taking the envelope of the BLIMFs, the sensitive BLIMFs are selected. And then we take the amplitude of the defect frequency (ADF) as a degradative feature. To get the performance degradation assessment, we are going to use the method called Gath-Geva clustering time series segmentation. Afterwards, the method is carried out by two pieces of run-to-failure data. The results indicate that the extracted feature could depict the process of degradation precisely.


---

## Body

## 1. Introduction

Rolling element bearings (REBs) are critical components of “rotor-bearing” system in rotating machinery. Since the cruel working condition, the REBs are vulnerable. So it is important to monitor their condition to avoid catastrophic accident in modern industry. There are many ways to monitor bearings, such as vibration [1], acoustic emission [2], oil-debris [3], and ultrasound [4]. Among them, the method based on vibration signal analysis is extensively used for a bearing.Recently, the prediction of the residual (or remaining) useful life (RUL) is a hotspot issue. To get a better bearing fault prediction result, the so-called performance degradation assessment (PDA) is a premise. The PDA contains two important aspects. One is to extract proper features that can reflect the process of degradation. The other one is to use a method to assess the REB’s performance. Feature extraction is the fundamental of PDA. The feature must reveal the real performance of the REB and be sensitive to the degradation. The types of features are usually classified into three categories, time domain features, frequency domain features, and time-frequency domain features. The time-frequency domain features are always based on time-frequency analysis, combined with the concept of spectrum, entropy, and complexity, for example, the Rényi entropy [5], the permutation entropy [6], and the general mathematical morphology particle [7]. In general, mechanical equipment undergoes a complete degradation from normal stage to failure. With the increasing of the running time and deepening of degradation, the amplitude of defect frequency (ADF) is raising therewith. So the ADF can reflect the degradation of REB directly.To get the ADF, the first thing is to locate the defect frequency. In extraction of ADF, the common method is to use EMD and select appropriate intrinsic mode function (IMF) components, taking the envelope spectrum, and finally get the ADF [8]. However, EMD remains an exclusively empirical algorithm, and it lacks a solid mathematical foundation. Despite numerous attempts to improve its performance, EMD is still of low efficiency and has endpoint effect and mode mixing problems. In 2014, Dragomiretskiy and Zosso [9] proposed a method called variational mode decomposition (VMD) as an alternative to EMD, which can adaptively decompose a multicomponent signal into a number of quasiorthogonal IMFs. It has been verified that VMD outperforms EMD with regard to tone detection and separation as well as noise robustness [10]. It has a good performance and high operation efficiency. Particularly, it has solid foundation for a mathematical theory. Now the method has been applied to the abnormal ECG signal detection [11], the stock market forecasting [12], wind power prediction [13], power quality classification [14], and so on.However, the parameters of VMD are selected by experience. Jun Zhu presented a method to optimize the parameters based on the kurtosis index through artificial fish swarm algorithm [15]. Tang and Wang used Shannon entropy as an index to optimize parameters by panicle swarm algorithm [16]. In this paper, we proposed a method to optimize the parameters based on BLIMFs themselves using genetic algorithm. As to PDA, Pan et al. [17] proposed a bearing degradation assessment method based on lifting wavelet packet decomposition and fuzzy C-means clustering. Wang et al. [18] proposed a method for PDA based on mathematical morphology fractal dimension and fuzzy C-means clustering. However, when using clustering, they only considered the distance factor, and no time parameter was recommended. The clusters should be contiguous in time. From this point of view, after extraction of ADF from the raw signals, the assessment of bearing performance is carried out by GGCTSS.The remainder of this paper is organized as follows. In Section1, the theory of VMD is briefly introduced. The optimization of the parameters is proposed in Section 2. In Section 3, by carrying out two run-to-failure data, we have extracted the ADF and used GGCTSS for PDA. Our conclusions are presented in Section 4.


## 2. VMD and Its Parameters

### 2.1. Variational Mode Decomposition

VMD can nonrecursively decompose a real-valued multicomponent signal into a discrete number of quasiorthogonal band-limited subsignalsuk with specific sparsity properties in the spectral domain. Each mode is compacted around a center pulsation ωk. For convenience, let us call these modes obtained by VMD as band-limited IMFs (BLIMFs). The VMD technique is essentially written as a constrained variational problem in [9](1)min∑k=1K∂tσt+jπt∗ukte-jwkt22Subject to∑k=1Kuk=f,where uk=u1,…,uk and ωk=ω1,…,ωk are the decomposed BLIMFs for the set of allK modes and their estimated center frequencies, respectively. The VMD process can be briefly described as follows; for further details, refer to [9].


### 2.2. Parameters Involved in VMD

There are six parameters for VMD, whereK represents the numbers of decomposition modes and α represents moderate bandwidth constraint; they are two parameters that significant influence on the decomposition results. In general, the parameter τ is set up to zero, which means that the Lagrangian multiplier is effectively shut off. The parameterinit is set to be one, which suggests that center frequencies of all the modes are initialized in the uniform distribution. The parameterDC is set to zero, for no DC part imposed. And the parametertol for tolerance is set as default value 1e-6.


### 2.3. The Optimization of VMD Parameters

Figure1 shows the impact of the parameter α. It can be seen that the parameter α seems to have an inverse ratio of the decomposition modes’ bandwidth. In Figure 1(a), there is no high frequency mode. It seems to be a better one with α=200 in Figure 1(b). Because the parameterinit is set to be one, the bandwidth of each mode is almost the same. To optimize the parameter K and α, A criterion must be raised. We have proposed a criterion η in formula (2).(2)η=∑iKl-l0fmax⁡,where l0 is the supposed frequency band of each mode andl is the actual frequency band of each mode. For example, in Figure 1(a), l0 is 0–2000 Hz, 2000–4000 Hz, 4000–6000 Hz, 6000–8000 Hz, and 8000–10000 Hz, and the actual frequency bands of BLIMFs are 0–1396 Hz, 1426–2549 Hz, 2900–4014 Hz, 3686–4620 Hz, and 3926–5376 Hz with the y-axis threshold 0.001. η is calculated to 0.4021, sinceK must be set as integer, but not for parameter α. We can find the optimized α using genetic algorithm of each mode. The settings of genetic algorithm are using default in MATLAB and finally get the bestK and α. The minimum ofK is 2. EMD can be used to find the maximum value ofK. There are 10 IMFs of the signal decomposed by EMD, so the maximum ofK is set up to 10.Figure 1
The impact of the parameterα.
(a)
α
=
200
0
(b)
α
=
200


## 2.1. Variational Mode Decomposition

VMD can nonrecursively decompose a real-valued multicomponent signal into a discrete number of quasiorthogonal band-limited subsignalsuk with specific sparsity properties in the spectral domain. Each mode is compacted around a center pulsation ωk. For convenience, let us call these modes obtained by VMD as band-limited IMFs (BLIMFs). The VMD technique is essentially written as a constrained variational problem in [9](1)min∑k=1K∂tσt+jπt∗ukte-jwkt22Subject to∑k=1Kuk=f,where uk=u1,…,uk and ωk=ω1,…,ωk are the decomposed BLIMFs for the set of allK modes and their estimated center frequencies, respectively. The VMD process can be briefly described as follows; for further details, refer to [9].


## 2.2. Parameters Involved in VMD

There are six parameters for VMD, whereK represents the numbers of decomposition modes and α represents moderate bandwidth constraint; they are two parameters that significant influence on the decomposition results. In general, the parameter τ is set up to zero, which means that the Lagrangian multiplier is effectively shut off. The parameterinit is set to be one, which suggests that center frequencies of all the modes are initialized in the uniform distribution. The parameterDC is set to zero, for no DC part imposed. And the parametertol for tolerance is set as default value 1e-6.


## 2.3. The Optimization of VMD Parameters

Figure1 shows the impact of the parameter α. It can be seen that the parameter α seems to have an inverse ratio of the decomposition modes’ bandwidth. In Figure 1(a), there is no high frequency mode. It seems to be a better one with α=200 in Figure 1(b). Because the parameterinit is set to be one, the bandwidth of each mode is almost the same. To optimize the parameter K and α, A criterion must be raised. We have proposed a criterion η in formula (2).(2)η=∑iKl-l0fmax⁡,where l0 is the supposed frequency band of each mode andl is the actual frequency band of each mode. For example, in Figure 1(a), l0 is 0–2000 Hz, 2000–4000 Hz, 4000–6000 Hz, 6000–8000 Hz, and 8000–10000 Hz, and the actual frequency bands of BLIMFs are 0–1396 Hz, 1426–2549 Hz, 2900–4014 Hz, 3686–4620 Hz, and 3926–5376 Hz with the y-axis threshold 0.001. η is calculated to 0.4021, sinceK must be set as integer, but not for parameter α. We can find the optimized α using genetic algorithm of each mode. The settings of genetic algorithm are using default in MATLAB and finally get the bestK and α. The minimum ofK is 2. EMD can be used to find the maximum value ofK. There are 10 IMFs of the signal decomposed by EMD, so the maximum ofK is set up to 10.Figure 1
The impact of the parameterα.
(a)
α
=
200
0
(b)
α
=
200


## 3. The Experimental Verification

### 3.1. Experiment Illustration

The run-to-failure REB’ test data are derived from IMS center [19]. The bearing test rig hosted four test bearings on a shaft. The shaft was driven by an AC motor. The rotation speed was kept constant at 2000 rpm. A radial load of 6000 lbs was added to the shaft and bearing by a spring mechanism. All the bearings are force oil-lubricated. Four Rexnord ZA-2115 double row bearings were installed on the shaft as shown in Figure 2. The bearings had 16 rollers in each row, a pitch diameter of 2.815 inch, roller diameter of 0.331 inch, and a tapered contact angle of 15.17°. A high sensitivity accelerometer was installed on each bearing’s housing. The data sampling rate was 20 kHz and the data length was 20480 points. The sampling interval was ten minutes. We use the Bearing1_1’s data of set number 2 which exhibits outer race defect as shown in Figure 3. The number of the data files is 982 (the original files number is 984, for the last 2 files it is vague and distinctive).Figure 2
Bearing test rig.Figure 3
Outer race defect of set number 2.For the theoretical value of outer race defect frequency, we can use the formula as follows and then have the theoretical frequency of 236.4 Hz:(3)fop=Z21-dDcos⁡θfr.From Figure4, we could not find the defect frequency of #600 (where # means the number of files). The range of α is set from 1000 to 10000. Now, by using genetic algorithm, the optimized parameter α ofK mode decomposition is presented in Table 1.Table 1
The optimized parameterα of each K mode decomposition.
K
The optimized parameterα
Criterionη
2
1382
0.9502
3
1044
1.1704
4
9534
0.9302
5
9651
1.2129
6
9736
1.5024
7
1423
1.5122
8
2321
1.6714
9
1537
2.2026
10
9286
1.5204Figure 4
The vibration wave and frequency spectrum of #600.From Table1, the optimized parameterK is for 4 and α for 9534. The decomposition result by optimized parameters is shown in Figure 5.Figure 5
The BLIMFs and frequency spectrum of #600.As shown in the figure, the signal is decomposed into 4 BLIMFs. The spectrum is in accordance with the order from low to high; that is, VMD has the role of band pass filtering. The BLIMFs do not show the phenomenon of mode mixing. The contrast group EMD, as shown in Figure6, is decomposed for 11 IMFs. As we can see, EMD has a characteristic that, with the order from low to high, IMF is narrowed approximate dichotomy, and each IMF has low frequency components, and LCD and LMD have similar characteristics. At the same time, the computing time of VMD is far less than EMD, because there is no recursive iteration process of VMD.Figure 6
The IMFs and frequency spectrum of #600.The signal of #600 is decomposed into 4 BLIMFs by optimized VMD and the envelope spectrum is shown in Figure7.Figure 7
The envelope spectrum of BLIMF1 to BLIMF4 of #600.
(a)
BLIMF1’s envelope
(b)
BLIMF2’s envelope
(c)
BLIMF3’s envelope
(d)
BLIMF4’s envelopeIt can be seen that the BLIMF2 and BLIMF3 have the peak of 230.7 Hz, which is close to the theoretical value 236.4 Hz. So the BLIMF2 and BLIMF3 are the right mode which have the defect frequency. By extracting the amplitude of all BLIMF2 and BLIMF3’s defect frequency, an ADF of all REB’s data is shown in Figure8.Figure 8
The ADF of the data.It can be seen from Figure8 that, before #520, the amplitude is close to zero. That indicates that there is no obvious defect before #520. From #520 to #700, the ADF increases in a linear way. Guess that spalling is formed and become larger, and the REB is in the slight fault stage. About #700, there is a sudden change, and we speculate that it is caused by a bulge or a crack. From #700 to #850, the amplitude decreases and rises again. The fluctuating trend can be explained by the nature of the propagating process of the damage, when the spalling formed and later smoothed by the continuous rolling contact. As the damage spread over a broader area, the vibration level raises again. This is called “healing” phenomenon and has been stated in [1, 20, 21]. Form #850 to the end #982, the condition of REB is becoming fierce. The “healing” phenomenon expands, and the variances enlarge. Overall, the ADF is increasing. If the ADF is segmented in 4 parts, it is rational for #1 to #520 for normal stage, #521 to #699 for slight fault stage, #700 to #850 for serious stage, and #851 to end for fault stage.


### 3.2. The PDA Using GGCTSS

As mentioned before, fuzzy C-means clustering has its drawback for PDA. As shown in Figure9. The four clustering results of the ADF are conducted by fuzzy C-means (the data have been normalized).Figure 9
The clustering result of the ADF proposed by fuzzy C-means.According to the clustering order from left to right, the first two clustering centers are in the normal state of the REB. The third center is in the slight fault state. The fourth one is almost close to the boundary of severely fault and failure. The result is unacceptable. References [17, 18] both used fuzzy C-means to realize PDA, Where owing to the degradation features which they have proposed is roughly monotonic, the cluster results of fuzzy C-means are basically distributed in time growth order. If the degradation features are inconspicuous or existing oscillation, we could not get a good clustering result. Therefore, it is necessary to import the concept of time series segmentation.A sequence ofNtimes observed data, T=x1,x2,…,xN, is called time series. Time series segmentation is to find a partitioning ofT intoc segments that are internally homogeneous. After a segmentation, T=x1,x2,…,xN can be partitioned into SN1,SN2,…,SNc, where SN1=S1,t1, SNn=Stn-1+1,tn, and 0<t1<⋯<tn-1<⋯<tc=N. The times t1,…,tn-1,…,tc are called segment boundaries or breaks, and the numbercis called the order of the segmentation. This segmentation is a crisp one. A time series segmentation problem can convert into an optimization. Himberg et al. [22] have defined the cost function. Under the definition, Kehagias et al. [23] proposed a dynamic programming (DP) segmentation procedure and Gedikli et al. [24] improved it with modified dynamic programming (mDP). Both methods are based on minimization of the summation of cost functions followed by distances between actual values and constant or linear fittings.Expanding and improving the crisp bounds of the segmentation, Abonyi et al. [25] developed an algorithm for dividing time series into fuzzy segments, which considered time series segmentation as Gath-Geva clustering with time parameter as an additional variable. The GGCTSS used local probabilistic principal component analysis (PPCA) models to measure the homogeneity of the segments and fuzzy sets to represent segments in time. The function to be optimized can be written as(4)J=∑i=1c∑k=1Nμi,kmD2zk,ηi,where the data point zk=tk,xkTT can be effectively modeled as a mixture of multivariate Gaussian distribution and μi,k stands for the ith segment membership of zk. The term m is weighing exponent of fuzzy degree, m∈1,∞. For general, m=2. The procedure of the GGCTSS can be written as follows:(
1
) Initial the order segmentationc, iteration numbers1, and the threshold for compatible cluster merging (0.75 as default).(
2
) Input the number of principal componentsq and make sure that the sum of the anteriorq eigenvalues account for more than 98% accuracy of the sum of all eigenvalues.(
3
) Finish the iteration and give the results of segmentation.The results include the fuzzy segmentation of a time series,βkti, which is defined as(5)βkti=Akti∑k=1KAkti∈0,1,where Akti is Gaussian membership function given by (6)Akti=exp⁡-12ti-μk2σk2.See [22] for more details of the method.The mDP algorithm is used to treat the ADF for the fourth-order segmentations, and the results are shown in Figure10.Figure 10
The optimal fourth-order segmentations of ADF by mDP algorithm. (a) Constant fitting and (b) linear fitting.
(a)
(b)It can be seen that the segmentations by mDP algorithm are not good. So, we use GGCTSS for PDA. The process of life was divided into 4 segments. Set the iteration to be 100 times. It is about 70 iterations that the result is basically unchanged. Figure11 shows the result.Figure 11
The result of the ADF based on GGCTSS.It can be seen that the four segmentations are partitioned according to the order of time. The normal stage is from #0 to #522, the slight stage is from #522 to #700, the severe stage is from #700 to #900, and the failure stage is from #900 to #982. It is possible to show that GGCTSS can be a good one for PDA.


### 3.3. Another Experiment Verification

IEEE PHM 2012 Prognostic Challenge data is another REBs’ data. Figure12 shows the experiment rig, the PRONOSTIA platform, where the data included three different loads for 1800 rpm and 4000 N, 1650 rpm and 4200 N, and 1500 rpm and 5000 N. The sampling frequency was 25.6 kHz, and 2560 samples were recorded each 10 seconds. There were 6 pieces of run-to-failure data which were the learning sets, and 11 test bearings were truncated so that participants were supposed to predict the remaining life (see Table 2) and thereby preformed RUL estimating. The learning set was quite small while the spread of the life duration of all bearings was very wide. Performing good estimates was thereby difficult and this made the challenge more exciting. More details can be seen in [26].Table 2
Datasets of PHM 2012 Prognostic Challenge.
Datasets
Operating conditions
Conditions 1(1800 rpm and 4000 N)
Conditions 1(1650 rpm and 4200 N)
Conditions 1(1500 rpm and 5000 N)
Learning set
Bearing1_1
Bearing2_1
Bearing3_1
Bearing1_2
Bearing2_2
Bearing3_2
Test set
Bearing1_3
Bearing2_3
Bearing3_3
Bearing1_4
Bearing2_4
Bearing1_5
Bearing2_5
Bearing1_6
Bearing2_6
Bearing1_7
Bearing2_7Figure 12
Overview of PRONOSTIA.The data is difficult to analysis because we know nothing about the nature and the origin of the degradation: inner or outer races. We are going to use Bearing1_1’s data and the characteristics of the tested bearing are shown in Table3. And the characteristics’ frequency of REB is 168.3 Hz for outer race, 221.7 Hz for inner race, 107.7 Hz for ball race, and 12.9 Hz for cage.Table 3
Characteristics of tested bearings.
Z (ball numbers of the REB)
13
d (diameter of the REB)
3.5 mm
D
m (bearing mean diameter)
25.6 mm
r (rotation rate)
1800 r/minThe numbers of Bearing1_1 are 2803, thus taking #2600 for analysis, since the REB is almost run to failure. Figure13 shows the signal.Figure 13
The signal of #2600.Now, by using genetic algorithm, we have the optimizedK and α, andK is for 3 and α for 4032. The signal is decomposed into 3 BLIMFs and the envelope spectrum is shown in Figure 14. It is obvious that BLIMF1 and BLIMF2 have the frequency of inner defect. So Bearing1_1 gets inner defect finally.Figure 14
The envelope spectrum of BLIMF1 to BLIMF3 of #2600.
(a)
BLIMF1’s envelope
(b)
BLIMF2’s envelope
(c)
BLIMF3’s envelopeBy extracting the amplitude of all BLIMF1 and BLIMF2’ defect frequency, an ADF of all Bearing1_1’s data is shown in Figure15.Figure 15
The ADF of the Bearing1_1.From Figure15, there are no evident boundaries of each degradation stage. At the end of the bearing’s life, there is a sudden increase. If we set the segment number as 3, the result is shown in Figure 16. The normal stage is from #0 to #1432, slight stage is from #1433 to #2264, and severe stage is from #2265 to #2803.Figure 16
The result of Bearing1_1’s ADF based on GGCTSS.


## 3.1. Experiment Illustration

The run-to-failure REB’ test data are derived from IMS center [19]. The bearing test rig hosted four test bearings on a shaft. The shaft was driven by an AC motor. The rotation speed was kept constant at 2000 rpm. A radial load of 6000 lbs was added to the shaft and bearing by a spring mechanism. All the bearings are force oil-lubricated. Four Rexnord ZA-2115 double row bearings were installed on the shaft as shown in Figure 2. The bearings had 16 rollers in each row, a pitch diameter of 2.815 inch, roller diameter of 0.331 inch, and a tapered contact angle of 15.17°. A high sensitivity accelerometer was installed on each bearing’s housing. The data sampling rate was 20 kHz and the data length was 20480 points. The sampling interval was ten minutes. We use the Bearing1_1’s data of set number 2 which exhibits outer race defect as shown in Figure 3. The number of the data files is 982 (the original files number is 984, for the last 2 files it is vague and distinctive).Figure 2
Bearing test rig.Figure 3
Outer race defect of set number 2.For the theoretical value of outer race defect frequency, we can use the formula as follows and then have the theoretical frequency of 236.4 Hz:(3)fop=Z21-dDcos⁡θfr.From Figure4, we could not find the defect frequency of #600 (where # means the number of files). The range of α is set from 1000 to 10000. Now, by using genetic algorithm, the optimized parameter α ofK mode decomposition is presented in Table 1.Table 1
The optimized parameterα of each K mode decomposition.
K
The optimized parameterα
Criterionη
2
1382
0.9502
3
1044
1.1704
4
9534
0.9302
5
9651
1.2129
6
9736
1.5024
7
1423
1.5122
8
2321
1.6714
9
1537
2.2026
10
9286
1.5204Figure 4
The vibration wave and frequency spectrum of #600.From Table1, the optimized parameterK is for 4 and α for 9534. The decomposition result by optimized parameters is shown in Figure 5.Figure 5
The BLIMFs and frequency spectrum of #600.As shown in the figure, the signal is decomposed into 4 BLIMFs. The spectrum is in accordance with the order from low to high; that is, VMD has the role of band pass filtering. The BLIMFs do not show the phenomenon of mode mixing. The contrast group EMD, as shown in Figure6, is decomposed for 11 IMFs. As we can see, EMD has a characteristic that, with the order from low to high, IMF is narrowed approximate dichotomy, and each IMF has low frequency components, and LCD and LMD have similar characteristics. At the same time, the computing time of VMD is far less than EMD, because there is no recursive iteration process of VMD.Figure 6
The IMFs and frequency spectrum of #600.The signal of #600 is decomposed into 4 BLIMFs by optimized VMD and the envelope spectrum is shown in Figure7.Figure 7
The envelope spectrum of BLIMF1 to BLIMF4 of #600.
(a)
BLIMF1’s envelope
(b)
BLIMF2’s envelope
(c)
BLIMF3’s envelope
(d)
BLIMF4’s envelopeIt can be seen that the BLIMF2 and BLIMF3 have the peak of 230.7 Hz, which is close to the theoretical value 236.4 Hz. So the BLIMF2 and BLIMF3 are the right mode which have the defect frequency. By extracting the amplitude of all BLIMF2 and BLIMF3’s defect frequency, an ADF of all REB’s data is shown in Figure8.Figure 8
The ADF of the data.It can be seen from Figure8 that, before #520, the amplitude is close to zero. That indicates that there is no obvious defect before #520. From #520 to #700, the ADF increases in a linear way. Guess that spalling is formed and become larger, and the REB is in the slight fault stage. About #700, there is a sudden change, and we speculate that it is caused by a bulge or a crack. From #700 to #850, the amplitude decreases and rises again. The fluctuating trend can be explained by the nature of the propagating process of the damage, when the spalling formed and later smoothed by the continuous rolling contact. As the damage spread over a broader area, the vibration level raises again. This is called “healing” phenomenon and has been stated in [1, 20, 21]. Form #850 to the end #982, the condition of REB is becoming fierce. The “healing” phenomenon expands, and the variances enlarge. Overall, the ADF is increasing. If the ADF is segmented in 4 parts, it is rational for #1 to #520 for normal stage, #521 to #699 for slight fault stage, #700 to #850 for serious stage, and #851 to end for fault stage.


## 3.2. The PDA Using GGCTSS

As mentioned before, fuzzy C-means clustering has its drawback for PDA. As shown in Figure9. The four clustering results of the ADF are conducted by fuzzy C-means (the data have been normalized).Figure 9
The clustering result of the ADF proposed by fuzzy C-means.According to the clustering order from left to right, the first two clustering centers are in the normal state of the REB. The third center is in the slight fault state. The fourth one is almost close to the boundary of severely fault and failure. The result is unacceptable. References [17, 18] both used fuzzy C-means to realize PDA, Where owing to the degradation features which they have proposed is roughly monotonic, the cluster results of fuzzy C-means are basically distributed in time growth order. If the degradation features are inconspicuous or existing oscillation, we could not get a good clustering result. Therefore, it is necessary to import the concept of time series segmentation.A sequence ofNtimes observed data, T=x1,x2,…,xN, is called time series. Time series segmentation is to find a partitioning ofT intoc segments that are internally homogeneous. After a segmentation, T=x1,x2,…,xN can be partitioned into SN1,SN2,…,SNc, where SN1=S1,t1, SNn=Stn-1+1,tn, and 0<t1<⋯<tn-1<⋯<tc=N. The times t1,…,tn-1,…,tc are called segment boundaries or breaks, and the numbercis called the order of the segmentation. This segmentation is a crisp one. A time series segmentation problem can convert into an optimization. Himberg et al. [22] have defined the cost function. Under the definition, Kehagias et al. [23] proposed a dynamic programming (DP) segmentation procedure and Gedikli et al. [24] improved it with modified dynamic programming (mDP). Both methods are based on minimization of the summation of cost functions followed by distances between actual values and constant or linear fittings.Expanding and improving the crisp bounds of the segmentation, Abonyi et al. [25] developed an algorithm for dividing time series into fuzzy segments, which considered time series segmentation as Gath-Geva clustering with time parameter as an additional variable. The GGCTSS used local probabilistic principal component analysis (PPCA) models to measure the homogeneity of the segments and fuzzy sets to represent segments in time. The function to be optimized can be written as(4)J=∑i=1c∑k=1Nμi,kmD2zk,ηi,where the data point zk=tk,xkTT can be effectively modeled as a mixture of multivariate Gaussian distribution and μi,k stands for the ith segment membership of zk. The term m is weighing exponent of fuzzy degree, m∈1,∞. For general, m=2. The procedure of the GGCTSS can be written as follows:(
1
) Initial the order segmentationc, iteration numbers1, and the threshold for compatible cluster merging (0.75 as default).(
2
) Input the number of principal componentsq and make sure that the sum of the anteriorq eigenvalues account for more than 98% accuracy of the sum of all eigenvalues.(
3
) Finish the iteration and give the results of segmentation.The results include the fuzzy segmentation of a time series,βkti, which is defined as(5)βkti=Akti∑k=1KAkti∈0,1,where Akti is Gaussian membership function given by (6)Akti=exp⁡-12ti-μk2σk2.See [22] for more details of the method.The mDP algorithm is used to treat the ADF for the fourth-order segmentations, and the results are shown in Figure10.Figure 10
The optimal fourth-order segmentations of ADF by mDP algorithm. (a) Constant fitting and (b) linear fitting.
(a)
(b)It can be seen that the segmentations by mDP algorithm are not good. So, we use GGCTSS for PDA. The process of life was divided into 4 segments. Set the iteration to be 100 times. It is about 70 iterations that the result is basically unchanged. Figure11 shows the result.Figure 11
The result of the ADF based on GGCTSS.It can be seen that the four segmentations are partitioned according to the order of time. The normal stage is from #0 to #522, the slight stage is from #522 to #700, the severe stage is from #700 to #900, and the failure stage is from #900 to #982. It is possible to show that GGCTSS can be a good one for PDA.


## 3.3. Another Experiment Verification

IEEE PHM 2012 Prognostic Challenge data is another REBs’ data. Figure12 shows the experiment rig, the PRONOSTIA platform, where the data included three different loads for 1800 rpm and 4000 N, 1650 rpm and 4200 N, and 1500 rpm and 5000 N. The sampling frequency was 25.6 kHz, and 2560 samples were recorded each 10 seconds. There were 6 pieces of run-to-failure data which were the learning sets, and 11 test bearings were truncated so that participants were supposed to predict the remaining life (see Table 2) and thereby preformed RUL estimating. The learning set was quite small while the spread of the life duration of all bearings was very wide. Performing good estimates was thereby difficult and this made the challenge more exciting. More details can be seen in [26].Table 2
Datasets of PHM 2012 Prognostic Challenge.
Datasets
Operating conditions
Conditions 1(1800 rpm and 4000 N)
Conditions 1(1650 rpm and 4200 N)
Conditions 1(1500 rpm and 5000 N)
Learning set
Bearing1_1
Bearing2_1
Bearing3_1
Bearing1_2
Bearing2_2
Bearing3_2
Test set
Bearing1_3
Bearing2_3
Bearing3_3
Bearing1_4
Bearing2_4
Bearing1_5
Bearing2_5
Bearing1_6
Bearing2_6
Bearing1_7
Bearing2_7Figure 12
Overview of PRONOSTIA.The data is difficult to analysis because we know nothing about the nature and the origin of the degradation: inner or outer races. We are going to use Bearing1_1’s data and the characteristics of the tested bearing are shown in Table3. And the characteristics’ frequency of REB is 168.3 Hz for outer race, 221.7 Hz for inner race, 107.7 Hz for ball race, and 12.9 Hz for cage.Table 3
Characteristics of tested bearings.
Z (ball numbers of the REB)
13
d (diameter of the REB)
3.5 mm
D
m (bearing mean diameter)
25.6 mm
r (rotation rate)
1800 r/minThe numbers of Bearing1_1 are 2803, thus taking #2600 for analysis, since the REB is almost run to failure. Figure13 shows the signal.Figure 13
The signal of #2600.Now, by using genetic algorithm, we have the optimizedK and α, andK is for 3 and α for 4032. The signal is decomposed into 3 BLIMFs and the envelope spectrum is shown in Figure 14. It is obvious that BLIMF1 and BLIMF2 have the frequency of inner defect. So Bearing1_1 gets inner defect finally.Figure 14
The envelope spectrum of BLIMF1 to BLIMF3 of #2600.
(a)
BLIMF1’s envelope
(b)
BLIMF2’s envelope
(c)
BLIMF3’s envelopeBy extracting the amplitude of all BLIMF1 and BLIMF2’ defect frequency, an ADF of all Bearing1_1’s data is shown in Figure15.Figure 15
The ADF of the Bearing1_1.From Figure15, there are no evident boundaries of each degradation stage. At the end of the bearing’s life, there is a sudden increase. If we set the segment number as 3, the result is shown in Figure 16. The normal stage is from #0 to #1432, slight stage is from #1433 to #2264, and severe stage is from #2265 to #2803.Figure 16
The result of Bearing1_1’s ADF based on GGCTSS.


## 4. Conclusions

This paper has proposed a method to assess the performance degradation of REB using VMD and GGCTSS. We have given a novel method to optimize the VMD parameter. By using GGCTSS, we can effectively segment the degradation process. From the above analysis, we can conclude that(1)
the ADF extracted by VMD can commendably reflect the degradation development of REBs;(2)
compared with crisp time series segmentation, the GGCTSS is more suitable for PDA of REBs.However, there are also some problems that should be focused on in the future study, for example, to optimize the selection of GGCTSS segment number.



---

*Source: 2598169-2017-10-12.xml*