Bearing fault diagnosis via generalized logarithm sparse regularization

• Published in: Mechanical systems and signal processing Vol. 167; p. 108576
• Main Authors: Zhang, Ziwei, Huang, Weiguo, Liao, Yi, Song, Zeshu, Shi, Juanjuan, Jiang, Xingxing, Shen, Changqing, Zhu, Zhongkui
• Format: Journal Article
• Language: English
• Published: Berlin Elsevier Ltd 15.03.2022; Elsevier BV
• Subjects: Algorithms; Bearing fault diagnosis; Computational geometry; Convex optimization; Convexity; Cost function; Fault diagnosis; Generalized logarithm(G-log) penalty; Noise monitoring; Optimization; Parameters; Reconstruction; Regularization; Representations; Rotating machinery; Signal monitoring; Sparse representation; Sparsity; Vibration monitoring; Bearing fault diagnosis; Sparse representation; Convex optimization; Generalized logarithm(G-log) penalty
• ISSN: 0888-3270; 1096-1216
• DOI: 10.1016/j.ymssp.2021.108576

•A new non-convex generalized logarithm(G-log) penalty is proposed for sparse representation.•The convexity of cost function is preserved by setting of parameter matrix.•The k-sparsity method is introduced to select the regularization parameter adaptively.•The simulation and experiment signal proved that the proposed G-log method shows more reconstruction accuracy. Bearing fault is the most common causes of rotating machinery failure. Therefore, accurate bearing fault identification technique is of tremendous significance. Vibration monitoring has been used widely and the key is to reconstruct the fault shock components from monitoring signals with noise. Sparse representation is proved to be a promising method to extract the repetitive transient component from noisy signals. However, common sparse representation methods suffer from the shortcomings of insufficient reconstruction accuracy or the underestimation of amplitude. To overcome these drawbacks, we proposed a new non-convex penalty called generalized logarithm(G-log) penalty, which enhances the sparsity and reduces noise disturbance. Although the proposed penalty is not convex itself, the cost function of sparse representation is preserved to be convex by parameter setting, hence the convex optimization algorithms are capable of being applied to obtain the global minimum. In addition, the k-sparsity method is used to decide the regularization parameter adaptively. Simulation and experiments verify that the proposed G-log method performs well in bearing fault diagnosis and generates more reconstruction accuracy compared to other sparse representation methods.