# Reliable Fault Classification of Induction Motors Using Texture Feature Extraction and a Multiclass Support Vector Machine

Authors: Jia Uddin; Myeongsu Kang; Dinh V. Nguyen; Jong-Myon Kim
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

This paper proposes a method for the reliable fault detection and classification of induction motors using two-dimensional (2D) texture features and a multiclass support vector machine (MCSVM). The proposed model first converts time-domain vibration signals to 2D gray images, resulting in texture patterns (or repetitive patterns), and extracts these texture features by generating the dominant neighborhood structure (DNS) map. The principal component analysis (PCA) is then used for the purpose of dimensionality reduction of the high-dimensional feature vector including the extracted texture features due to the fact that the high-dimensional feature vector can degrade classification performance, and this paper configures an effective feature vector including discriminative fault features for diagnosis. Finally, the proposed approach utilizes the one-against-all (OAA) multiclass support vector machines (MCSVMs) to identify induction motor failures. In this study, the Gaussian radial basis function kernel cooperates with OAA MCSVMs to deal with nonlinear fault features. Experimental results demonstrate that the proposed approach outperforms three state-of-the-art fault diagnosis algorithms in terms of fault classification accuracy, yielding an average classification accuracy of 100% even in noisy environments.


---

## Body

## 1. Introduction

Induction motors are widely used in rotary machinery systems, including both heavy-and light-duty machinery [1], and play an important role in the industry due to their hardiness, low cost, and low maintenance requirements. An induction motor usually falls out of service due to the following reasons: the application of an unexpected heavy load, unsuitable or inadequate lubrication, and ineffective sealing. With the increase in the production capabilities of current manufacturing systems, machines are expected to run continuously, making unexpected interruptions due to machine failure being more costly than ever. Fault diagnosis for industrial induction motors is therefore a significant issue. Reliable, fast, automated, and state-monitoring schemes have been widely used to identify specific failures in various induction motor components.In general, feature extraction can be performed by matching similarities between different signals [2, 3]. In order to extract the features of numerous faults, current, voltage, vibration, infrared thermography, and acoustic emission signals were utilized as sources to monitor fault states [4]. Among the signals, vibration analysis has been the most frequently employed methodology for identifying induction motor faults due to its ability to represent intrinsic information of them [5].These vibration signals are analyzed in time domain, frequency domain, and time-frequency domain [6, 7]. The time-domain analysis determines numerous characteristics from a signal waveform, such as the root mean square (RMS), skewness, kurtosis, and crest factor, and applies these parameters in the diagnosis of inductions motors [8]. Although the scalar descriptors extracted from time signals are robust in terms of fluctuating load, they are not consistently effective, particularly in the presence of increased defects [9]. In contrast, frequency analysis considers only the frequency components, neglecting amplitude, where the frequency patterns are closed to the rotation properties of the machine. A number of time-frequency techniques have been proposed as a trade-off between the time and frequency domain techniques.In the traditional approaches, signals are processed as a one-dimensional (1D) representation, where the relationship information between time and frequency coefficients may be easily lost. In addition, the features collected from either the raw or processed signals have large dimensions that usually increase the computational burden of the subsequent classifier and degrade the generalization capability of a classifier. A significant number of well-known classifiers have been used for fault diagnosis, including artificial neural network (ANN), support vector machine (SVM), simplified fuzzy art map (SFAM), and fuzzy art map (FAM). Conventional feature extraction techniques that collect feature vectors from raw signals are not functional in practical scenarios, because load and rotational speed can vary at any instant. Therefore, an efficient approach for feature extraction with an effective dimension reduction technique is essential.In this paper, a multifault detection and classification approach is proposed that first converts vibration signals to two-dimensional (2D) gray images by transforming the amplitude of the signals into the intensity of the pixels in an image. Due to the fact that the converted gray-level images show texture patterns (or repetitive patterns), the dominant neighborhood structure (DNS) map is generated to extract the texture features of the converted images in this paper. In general, a feature vector including the extracted texture features is high-dimensional and its high dimensionality can degrade classification performance. Hence, this paper exploits a principal component analysis (PCA) for dimensionality reduction of the feature vector. Finally, the reduced feature vector with discriminative fault features is used as input for the multiclass support vector machines (MCSVMs) to identify each fault in an induction motor. The proposed approach is compared with three conventional techniques in terms of classification accuracy in both noiseless and noisy environments.The rest of the paper is organized as follows. Section2 introduces related works, and Section 3 presents the proposed fault diagnosis method. Section 4 describes a detailed implementation of the proposed approach. Section 5 analyzes the experimental results of the proposed approach and compares the classification accuracy of the proposed approach with other conventional techniques. Finally, Section 6 concludes this paper.


## 2. Related Works

Several fault-state monitoring techniques have been proposed to improve robustness, reliability, and production capacity and reduce maintenance costs [4, 8, 10–19]. The proposed techniques include short-time Fourier transform (STFT), scale-invariant feature transform (SIFT), wavelet packet transform (WPT), Wigner-Ville distribution (WVD), Gabor filter, Hilbert Huang transform (HHT), empirical mode decomposition (EMD), local mean decomposition (LMD), and local characteristic-scale decomposition (LCD). Lei et al. proposed an intelligent classification method using WPT and EMD [10]. Dimensionless time-domain feature vectors were extracted from each of the original vibration signals and preprocessed to form a combined feature set. In [11], a systematic procedure using an adaptive learning system such as ANNs [20] was proposed for fault diagnosis in induction motors, where the time-domain features were calculated from the input signals. William and Hoffman proposed an early fault detection approach using the zero-crossing time-domain features [12]. These features were collected from the input during the zero-crossing intervals. As a result, estimation of the rotational frequency was not required. Rodriguez-Donate et al. proposed a quantitative general methodology for online monitoring of an induction motor and an automatic identification of multiple faults based on the startup vibration transient analysis [4]. Yang and Kim proposed a fault diagnosis model using the Dempster-Shafer theory, a combinational rule using current and vibration signals concurrently to extract feature vectors [13]. Bafroui and Ohadi proposed a fault diagnosis model to process nonstationary vibration signals, where a resample technique at a constant angle increment is combined with the continuous wavelet transform (CWT) and measured the numerous statistical parameters from the wavelet coefficients [19]. An improved HHT-based detection methodology was proposed in [21] for removing undesirable intrinsic mode functions (IMFs), where noisy IMFs were selected based on a threshold value. A new self-adaptive time-frequency domain method, LMD, was proposed that produces a number of product functions, and a multiscale entropy of each product function was utilized to calculate the feature vectors [22]. Zheng et al. proposed a new nonstationary fault diagnosis method, LCD, which decomposes the vibration signal adaptively in a series of intrinsic scale components (ISC) for different scales [23].


## 3. Proposed Model

Figure1 presents a block diagram of the proposed model consisting of the following four blocks: data conversion, texture feature extraction, texture feature reduction, and classification.Figure 1
A block diagram of the proposed fault diagnosis methodology.First, data conversion process is carried out in order to produce 2D gray-level images from 1D vibration signals. In the data conversion process, the amplitude of each sample of the vibration signal is normalized to range from 0 to 255, and the normalized amplitude of each sample becomes the intensity of the corresponding pixel, as shown in Figure2. The coordinate of the corresponding pixel for the ith sample of the vibration signal is pixel (j,k), where j = modulo (i/M), k = floor (i/M)+1, M is the column length of an M×N image, and N is the row length of an M×N image.Figure 2
Data conversion process to represent a two-dimensional gray-level image from a one-dimensional vibration signal.We then generate a DNS map to extract texture features in the converted image [24] and the overall process of the DNS map generation can be summarized as follows.Step 1.
The center pixel is located at the center of the search window and the other pixels in the search window are neighboring pixels. To generate a DNS map, vectorsv(Ni) and v(Nj) are first created, where v(Ni) is the vector of the neighborhood pixel values around the pixel i surrounded by the n×n neighborhood window, v(Nj) is the vector of neighboring pixels within the neighborhood window, the pixel i refers to the pixel intensity at the center of the m×m search window, and the pixel j indicates each pixel value of the search window.Step 2.
Euclidean distances are then computed between the two generated vectors and all of the pixels in the search window are replaced with Euclidean distances. In this study, the center pixel is also considered to be a neighborhood pixel and the Euclidean distance can be 0 ifv(Ni)=v(Nj).Step 3.
The spacing interval is the distance between pixels used to build the DNS map, which affects the resolution at which the global neighborhood similarity is captured. To produce the DNS map at a given scale of resolution, it is important to have a sufficient number of neighborhood structure maps. This can be achieved by moving the predefinedm×m search window at a certain spacing interval between the previous search window and the current search window. The spacing interval was experimentally determined in this study, which is set to 5.Since the converted texture image can be rotated by a certain rotation angle, it is necessary to extract rotationally invariant features. To deal with this problem, the DNS map values are sampled on circumferences of concentric circles of various radii centered at the center pixel of the map. However, the dimensionality of a feature vector including these texture features is high, which can degrade classification performance. Thus, selection of the most discriminative feature is vital for reliable fault diagnosis. For the purpose of dimensionality reduction in this study, we utilize PCA [25] to select the most distinctive features between classes. The PCA algorithm reduces the dimension of the feature vectors by selecting only the principal components, where a principal component is defined by a linear transformation of the original variables into a new set of uncorrelated variables. PCA finds a new set of feature vectors with principal directions (PDs) and insignificant directions (IDs), where PDs have large covariance and IDs have small covariance. Among these new feature vectors, only the most significant features are utilized as inputs to the classifier.Finally, we utilize multiclass SVM (MCSVM) as a classifier, where the Gaussian radial basis function is used as a function kernel to ensure efficient nonlinear classification between faults. In order to design MCSVMs, the following three approaches can be considered: one-against-all (OAA), one-against-one (OAO), and one-acyclic-graph (OAG). Among them, the OAA method is employed, which is one of the most popular and simplest techniques for multiclass classifiers. In the OAA approach, each SVM structure discriminates one class from the others, and the final decision can be made by selecting the SVM structure yielding the highest output value.In order to design OAA MCSVMs, each SVM structure is separately evaluated to achieve the maximum classification accuracy for its own class. Then, all SVM structures cooperate together to make a final decision. If none of the classes can recognize what type of fault the input signal is, the final decision is assigned tounknown. OAA MCSVMs for classifying faults are illustrated in Figure 3. To train and test OAA MCSVMs, it is necessary to build a training dataset using 50% of the 105 vibration signals for each fault, including normal signals and a test dataset with the remaining signals in this study (e.g., 53 one-second vibration signals are used as the training data set, and 52 one-second vibration signals are used as the test data set).Figure 3
OAA MCSVMs for identifying induction motor failures.


## 4. Implementation of the Proposed Model

In our experiment, we utilized eight types of signals: angular misalignment fault (AMF), bearing fault (BF), bowed shaft fault (BSF), phase imbalance fault (PMF), broken rotor bar fault (BRBF), rotor imbalance fault (RIF), phase imbalance fault (PIF), and healthy (NO). We acquired one-second 105 vibration signals for each fault condition from the accelerometer located at the axial direction of the induction motor and Table1 presents a brief description of each fault used in this study.Table 1
Description of induction motor faults.
Type of faults
Fault description
Angular misalignment fault (AMF)
Angular misalignment is the effective angle between the two shaft centerlines, the angle between the shaft centerlines is 0.48°
Broken rotor bar fault (BRBF)
Among 34 rotor bars, 12 rotor bars are involved in the plastic deformation of the grinding furrow: 5 mm in diameter and 15 mm in depth
Parallel misalignment fault (PMF)
The offset between two centerlines of the motor and load has been changed 0.1 mm
Rotor imbalance fault (RIF)
Unbalance mass of 15.64 g cm is added at the right end of the rotor
Bearing fault (BF)
A spalling on the outer race of the bearing is replicated
Bowed shaft fault (BSF)
The shaft is slack in the middle (0.075 mm), which causes dynamic air-gap eccentricity
Phase imbalance fault (PIF)
4.3Ω resistance is connected to one of the three-phase wires of the induction motorTo efficiently observe the relationship of samples, this paper converts one-second 1D time-domain vibration signal into a 2D gray-level image with a size of 89 × 89 and Figure4 shows a 2D representation of vibration signals for each fault condition. Likewise, Table 2 shows parameters (e.g., search window size, neighborhood window size, and so on) for generating a DNS map and Figure 5 depicts the DNS map for each fault condition.Table 2
Parameter setups for generating a DNS map.
Parameters
Values
Searching window size
21 × 21
Neighbor window
13 × 13
Number of central pixels
144
Size of DNS map
21 × 21
Gap between two central pixels
5 pixelsFigure 4
Examples of 2D representation of vibration signals.Figure 5
DNS maps obtained from the converted texture images.As mentioned in previous section, DNS map values are sampled on circumferences of concentric circles of various radii centered at the center pixel of the map. For a DNS map of size 21 × 21, ten circles are used in order to cover all of the DNS map regions. For circles of radii greater than two pixels, 24 uniform angular measurements are extracted. Only 8 and 16 measurements are extracted from the first two innermost circles. Therefore, the number of dimensions of the feature vector is 216 (= 8 + 16 + 8 × 24) and Figure6 illustrates 1 × 216 feature vectors including rotationally invariant features for each fault condition.Figure 6
1 × 216 Feature vectors including rotationally invariant features for various induction motor faults.It was found that computational complexity typically increases and overall classification accuracy decreases with the high-dimensional feature vector. Thus, we employed the PCA to reduce computational complexity and improve the overall classification accuracy by selecting the most discriminative features from the high-dimensional feature vector. Figure7 demonstrates magnitudes of several principal components after applying the PCA to the high-dimensional feature vectors. For the PCA, it is necessary to determine the most influential component for fault diagnosis and Figure 8 shows the classification results with different numbers of principal components. As depicted in Figure 8, the proposed fault diagnosis methodology achieves maximum classification accuracies when we utilize first three to six principal components as inputs of OAA MCSVMs and consequently this paper utilizes the first three principal components as fault features in this study providing both the highest classification performance and the lowest computational time.Figure 7
Patterns of principal components of each induction motor fault.Figure 8
Classification accuracy with different numbers of principal components.In the observation and testing process, we utilized SVM with a Gaussian radial basis function (RBF) kernel [17] because the RBF kernel shows an exceptional ability to handle the nonlinear problem inherent in the time-varying vibration signals caused by motor slippage and variable rotational speed. The Gaussian radial basis function kernel is represented as follows [26]:
(1)k(svi,svj)=exp⁡(-∥svi-svj∥22σ2),
where k(svi,svj) is the RBF kernel, svi and svj are the input feature vectors, and σ is a parameter set by users to determine the effective width of the RBF kernel. The selection of an optimal σ value of the RBF kernel is an important issue. Therefore, this paper explores the impact of σ values on the classification performance in the range from 0.1 to 2 at intervals of 0.1. Table 3 presents the optimal range of σ values for each SVM in order to classify faults of the induction motor.Table 3
Optimal sigma values of each SVM strutcure.
Faults
Optimal range
Selected values
AMF (SVM1: class 1)
0.2
<
σ
<
2.0
1.0
BRBF (SVM2: class 2)
0.1
<
σ
<
2.0
0.9
NO (SVM3: class 3)
0.1
<
σ
<
1.4
0.6
RIF (SVM4: class 4)
0.1
<
σ
<
1.9
1.0
BF (SVM5: class 5)
0.1
<
σ
<
0.3
0.2
BSF (SVM6: class 6)
0.1
<
σ
<
0.4
0.2
PMF (SVM7: class 7)
0.1
<
σ
<
1.2
0.6
PIF (SVM8: class 8)
0.1
<
σ
<
1.1
0.5


## 5. Experimental Results

The performance of the proposed model is evaluated in terms of true positive (TP) and false positive (FP) classification accuracy [27], where TP represents the number of faults in class i that are correctly classified into class i, and FP is the number of faults in other classes that are incorrectly classified into class i. Furthermore, since the vibration signals can be influenced by various noise levels in real industrial environment, we evaluate the robustness of the proposed fault diagnosis approach in noisy environments by artificially adding white Gaussian noise to the acquired vibration signals and setting the signal-to-noise ratio (SNR) between the originally acquired vibration signals and the noise-inserted vibration signals at 15 dB and 20 dB, respectively. To guarantee the reliability of the proposed fault diagnosis approach in terms of classification accuracy, we evaluate it ten times with randomly generated training data and test data at each iteration. The final classification accuracy can be obtained by averaging the total classification accuracies. Tables 4, 5, and 6 show the average classification accuracies of the proposed and conventional algorithms in noiseless and noisy environments.Table 4
True positive and false positive of classification accuracy without noise.
Algorithm
Average classification accuracy in terms of true positive and false positive
Average
AMF
BRBF
NO
RIF
BF
BSF
PMF
PIF
Algorithm1 [11]
TP
91.35
91.54
84.23
90.38
96.73
98.46
97.11
80.19
91.24875
FP
1.54
1.24
2.17
0.80
0.22
0.47
0.63
3.24
1.28875
Algorithm2 [10]
TP
98.85
93.85
90.00
100.00
100.00
100.00
96.73
99.04
97.30875
FP
0.00
1.59
1.02
0.00
0.00
0.00
0.76
0.00
0.42125
Algorithm3
[4]
TP
100.0
100.0
100.0
100.00
100.00
100.00
100.00
100.0
100
FP
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0
Proposed approach
TP
100.0
100.00
100.00
100.00
100.00
100.00
100.00
100.0
100.00
FP
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0.00Table 5
True positive and false positive of classification accuracy with noise (SNR = 15 dB).
Algorithm
Average classification accuracy in terms of true positive and false positive
Average
AMF
BRBF
NO
RIF
BF
BSF
PMF
PIF
Algorithm1 [11]
TP
91.45
88.00
84.00
90.91
96.00
98.91
95.19
79.82
90.535
FP
1.95
0.49
2.57
0.99
0.16
0.57
0.25
3.40
1.2975
Algorithm2 [10]
TP
96.15
85.57
48.26
78.46
100.00
100.00
96.92
100.0
88.17
FP
0.00
10.83
0.73
0.03
0.00
0.000
3.18
3.65
2.3025
Algorithm3 [4]
TP
34.42
0.00
7.50
100.00
100.00
100.00
91.73
91.92
65.69625
FP
0.00
0.00
7.45
23.74
2.31
4.53
0.00
0.00
4.75375
Proposed approach
TP
100.0
94.61
100.0
100.00
100.00
100.00
100.00
100.0
100.00
FP
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0.00Table 6
True positive and false positive of classification accuracy with noise (SNR = 20 dB).
Algorithm
Average classification accuracy in terms of true positive and false positive
Average
AMF
BRBF
NO
RIF
BF
BSF
PMF
PIF
Algorithm1 [11]
TP
91.54
88.08
84.04
90.96
95.96
99.04
95.96
79.81
90.67375
FP
1.92
0.49
2.58
0.99
0.14
0.58
0.41
3.38
1.31125
Algorithm2 [10]
TP
98.27
86.92
72.31
99.23
99.42
100.00
93.84
100.0
93.74875
FP
0.00
3.65
1.32
0.14
0.00
0.14
0.91
1.02
0.8975
Algorithm3 [4]
TP
97.31
87.88
84.42
100.00
100.00
100.00
100.00
100.0
96.20125
FP
0.00
0.00
1.43
2.61
0.30
0.00
0.00
0.00
0.5425
Proposed approach
TP
100.0
100.0
100.0
100.00
100.00
100.00
100.00
100.0
100.00
FP
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0.00
0.00Experimental results show that the proposed approach achieves 100% classification accuracy even in noisy environments. We observe that the number of significant pixels does not show abrupt change even if noise is included in the vibration signals to a limited value. In contrast, Algorithm 1 [11], which utilizes the time-domain statistical features (RMS, variance, skewness, and kurtosis) from the vibration signal, provides relatively lower classification accuracy for BRBF, NO, RIF, and PIF than those for AMF, BF, BSF, and PMF in noisy environments. This is due to the characteristics of BRBF, NO, RIF, and PIF which are not distinctive enough each other. Algorithm 2 [10], utilizing a combination of wavelet packet transform (WPT) and empirical decomposition, also fails to provide high classification accuracy in noisy environments due to its limitation in selecting the correct number of significant IMFs from the EMD algorithm. Algorithm 3 [4] uses the reconstruction of discrete wavelet packet nodes with information entropy and also exhibits low classification accuracies in noisy environments due to the nonadaptive selection of the decomposition signal level. Overall, the proposed fault diagnosis model outperforms other conventional algorithms in classification accuracy both with and without a noisy environment.


## 6. Conclusions

This paper proposed a robust fault detection and classification approach for induction motors using texture feature extraction and OAA MCSVMs. In the proposed approach, time-domain vibration signals were first converted into gray images to exploit texture features from the converted images of each faulty vibration signal. Feature vectors were then calculated from the DNS maps of the images. The PCA was utilized to select the most discriminative features by eliminating the trivial ones. Finally, using the distinctive features as inputs, OAA MCSVMs identify each fault of the induction motor. Experimental results showed that the proposed approach achieves 100% classification accuracy even in noisy environments.



---

*Source: 814593-2014-06-29.xml*