Weak fault feature extraction of rolling bearings based on globally optimized sparse coding and approximate SVD

被引:67
作者
Hou, Fatao [1 ]
Chen, Jin [1 ]
Dong, Guangming [1 ]
机构
[1] Shanghai Jiao Tong Univ, State Key Lab Mech Syst & Vibrat, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Globally optimized sparse coding; Approximate SVD; K-SVD; Dictionary learning; Rolling bearing; De-noising; Weak fault feature extraction; ATOMIC DECOMPOSITION; INVERSE PROBLEMS; DIAGNOSIS; ALGORITHM;
D O I
10.1016/j.ymssp.2018.04.003
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
Fault feature extraction is crucial to condition monitoring and fault prognostics. However, when fault is in the initial stage, it is often very weak and submerged in the strong noise. This makes the fault feature very difficult to be extracted. In this paper, we propose a novel method based on sparse representation theory. It is inspired by the traditional K-SVD based de-noising method and can penetrate into the underlying structure of the signal. It learns sparse coefficients and dictionary from the noisy signal itself. The coefficients are globally optimized based on an (l1)-regularized least square problem solving method, which can locate the impulse coordinates more accurately compared with orthonormal matching pursuit (OMP) applied in the traditional K-SVD. The dictionary learning is based on an approximation of singular value decomposition (SVD). With the learned dictionary, we can capture the higher-level structure of the signal. Combining the sparse coefficients and the learned dictionary, we can de-noise the signal effectively and extract the incipient weak fault features of rolling bearings. The results of processing both simulated and experimental signals are illustrated and both validate the proposed method. All the experimental data are also processed by SpaEIAD, wavelet shrinkage, and fast kurtogram for comparison. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:234 / 250
页数:17
相关论文
共 32 条
[1]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[2]  
[Anonymous], WAVELET TOUR SIGNAL
[3]   The spectral kurtosis: application to the vibratory surveillance and diagnostics of rotating machines [J].
Antoni, J ;
Randall, RB .
MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2006, 20 (02) :308-331
[4]   Fast computation of the kurtogram for the detection of transient faults [J].
Antoni, Jerome .
MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2007, 21 (01) :108-124
[5]  
Candès EJ, 2002, ANN STAT, V30, P784
[6]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[7]   Compressed sensing based on dictionary learning for extracting impulse components [J].
Chen, Xuefeng ;
Du, Zhaohui ;
Li, Jimeng ;
Li, Xiang ;
Zhang, Han .
SIGNAL PROCESSING, 2014, 96 :94-109
[8]   An iterative thresholding algorithm for linear inverse problems with a sparsity constraint [J].
Daubechies, I ;
Defrise, M ;
De Mol, C .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2004, 57 (11) :1413-1457
[9]  
Donoho D, 1995, DENOISING SOFT THRES
[10]   IDEAL SPATIAL ADAPTATION BY WAVELET SHRINKAGE [J].
DONOHO, DL ;
JOHNSTONE, IM .
BIOMETRIKA, 1994, 81 (03) :425-455