版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Xi An Jiao Tong Univ Sch Mech Engn Xian 710049 Shaanxi Peoples R China Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710049 Shaanxi Peoples R China
出 版 物:《NEUROCOMPUTING》 (神经计算)
年 卷 期:2018年第314卷
页 面:445-457页
核心收录:
学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:Provincial Key Research Project of Shaanxi [0101/321100081601]
主 题:Bearing fault detection Signal decomposition Unsupervised deep learning Convolutional restricted Boltzmann machine Shift-invariant feature learning
摘 要:Transient impulse contains abundant information of bearings status. When fault occurs, it is activated and would recur periodically or quasi-periodically. Its period can indicate where defects lie in. However, transient impulse is easily swallowed by background noise or interferences in part or in whole, especially at early stage of fault. This problem brings hard obstacles into faults detection. Considering that transient impulses are periodical or quasi-periodical and vibration signal has local similarity, the single transient impulse can be seen as one of shift-invariant features. In view of this, this paper derives adaptive and non-linear signal decomposition formulas and further proposes adaptive and unsupervised feature learning method by using convolutional restricted Boltzmann machine model. With respecting local waveform structures, this method can automatically capture shift-invariant patterns hidden in original signal and decompose the original signal into several sub-components at the cost of minimizing reconstruction error. Among these sub-components, the fault-related information, i.e., transient impulses signal, could be extracted likely. It provides a promising idea for intelligent signal processing by using unsupervised learning. Afterwards, Maximizing kurtosis is applied to select optimally latent fault component. Two real bearing experiments validate this method is effective and reliable in extraction of weak transient impulses. (C) 2018 Elsevier B.V. All rights reserved.