To improve the fault identification accuracy of rolling bearing and effectively analyze the fault severity, a novel rolling bearing fault diagnosis and severity analysis method based on the fast sample entropy, the wavelet packet energy entropy, and a multiclass relevance vector machine is proposed in this paper. A fast sample entropy calculation method based on a kd tree is adopted to improve the real-time performance of fault detection in this paper. In view of the non-linearity and non-stationarity of the vibration signals, the vibration signal of the rolling bearing is decomposed into several sub-signals containing fault information by using a wavelet packet. Then, the energy entropy values of the sub-signals decomposed by the wavelet packet are calculated to generate the feature vectors for describing different fault types and severity levels of rolling bearings. The multiclass relevance vector machine modeled by the feature vectors of different fault types and severity levels is used to realize fault type identification and a fault severity analysis of the bearings. The proposed fault diagnosis and severity analysis method is fully evaluated by experiments. The experimental results demonstrate that the fault detection method based on the sample entropy can effectively detect rolling bearing failure. The fault feature extraction method based on the wavelet packet energy entropy can effectively extract the fault features of vibration signals and a multiclass relevance vector machine can identify the fault type and severity by means of the fault features contained in these signals. Compared with some existing bearing rolling fault diagnosis methods, the proposed method is excellent for fault diagnosis and severity analysis and improves the fault identification rate reaching as high as 99.47%.
A rolling bearing is an important connecting part between rotating machines. It is susceptible to mechanical stress and wear, which affect the running state of bearings. In order to effectively identify the fault types and analyze the fault severity of rolling bearings, a rolling bearing fault diagnosis method based on multiscale amplitude-aware permutation entropy (MAAPE) and random forest is proposed in this paper. The vibration signals of rolling bearings to be analyzed are decomposed into different coarse-grained time series by using the coarse-graining procedure in multiscale entropy, highlighting the fault dynamic characteristics of vibration signals at different scales. The fault features contained in the coarse-grained time series at different time scales are extracted by using amplitude-aware permutation entropy’s sensitive characteristics to signal amplitude and frequency changes to form fault feature vectors. The fault feature vector set is used to establish the random forest multi-classifier, and the fault type identification and fault severity analysis of rolling bearings is realized through random forest. In order to demonstrate the feasibility and effectiveness of the proposed method, experiments were fully conducted in this paper. The experimental results show that multiscale amplitude-aware permutation entropy can effectively extract fault features of rolling bearings from vibration signals, and the extracted feature vectors have high separability. Compared with other rolling bearing fault diagnosis methods, the proposed method not only has higher fault type identification accuracy, but also can analyze the fault severity of rolling bearings to some extent. The identification accuracy of four fault types is up to 96.0% and the fault recognition accuracy under different fault severity reached 92.8%.
This paper proposes a novel fault diagnosis method for rolling bearing based on hierarchical refined composite multiscale fluctuation-based dispersion entropy (HRCMFDE) and particle swarm optimization-based extreme learning machine (PSO-ELM). First, HRCMFDE is used to extract fault features in the vibration signal at different time scales. By introducing the hierarchical theory algorithm into the vibration signal decomposition process, the problem of missing high-frequency signals in the coarse-grained process is solved. Fluctuation-based dispersion entropy (FDE) has the characteristics of insensitivity to noise interference and high computational efficiency based on the consideration of nonlinear time series fluctuations, which makes the extracted feature vectors more effective in describing the fault information embedded in each frequency band of the vibration signal. Then, PSO is used to optimize the input weights and hidden layer neuron thresholds of the ELM model to improve the fault identification capability of the ELM classifier. Finally, the performance of the proposed rolling bearing fault diagnosis method is verified and analyzed by using the CWRU dataset and MFPT dataset as experimental cases, respectively. The results show that the proposed method has high identification accuracy for the fault diagnosis of rolling bearings with varying loads and has a good load migration effect.
YOLO v3 has poor accuracy in target location recognition, and the detection effect needs to be improved in complex scenes with dense target distribution and large size differences. To solve this problem, an improved multi-scale target detection algorithm based on feature fusion (FF-YOLO) is proposed in this paper. Firstly, the residual structure in Darknet53 backbone of YOLO v3 is replaced by the optimized dense connection network FCN-DenseNet, and features are extracted effectively through feature reuse, and the problem of vanishing gradient is further alleviated. Secondly, based on the three-scale prediction mechanism of YOLO v3, we added a fourth detection scale to make the network learn more shallower location information. Finally, Spatial Pyramid Pooling (SPP) module is added before each detection layer to make the local feature information deeply fused. It increases the receptive field of the backbone network and significantly isolates the most important contextual feature receptive. Experiments show that FF-YOLO can effectively improve the detection accuracy of multi-scale targets in complex scenes. On Pascal VOC2007 data set, the mAP of FF-YOLO is 5.8% higher than that of YOLO v3. At the same time, the mAP of FF-YOLO for medium and small targets are 1.5% and 2.2% higher than that of YOLO v3 on MS COCO data set.
Hyperspectral image (HSI) classification methods based on three-dimensional convolutional neural network (3DCNN) have problems of overfitting the in-sample training process and difficulty in highlighting the role of discriminant features, which reduce the classification accuracy. To solve the above problems, an HSI classification method based on M-3DCNN-Attention is proposed. First, the Mixup algorithm is used to construct HSI virtual samples to expand the original data set. The sample size of the expanded data set is twice that of the original data set, which greatly alleviates the overfitting phenomenon caused by the small sample of HSI. Second, the structure of 3DCNN is improved. A convolutional block attention module (CBAM) is added between each 3D convolutional layer and ReLU layer, and a total of three CBAMs are used so as to highlight the discriminant features in spectral and spatial dimensions of HSI and suppress the nondiscriminant features. Finally, the spectral–spatial features are transferred to the Softmax classifier to obtain the final classification results. The comparative experiments are conducted on three hyperspectral data sets (Indian Pines, University of PaviaU, and Salinas), and the overall accuracy of M-3DCNN-Attention is 99.90%, 99.93%, and 99.36%, respectively, which is better than the comparative methods.