Group-Sparsity Learning Approach for Bearing Fault Diagnosis

Abstract

Fault impulse extraction under strong background noise and/or multiple interferences is a challenging task for bearing fault diagnosis. Sparse representation has been widely applied to extract fault impulses and can achieve state-of-the-art performance. However, most of the current methods rely on carefully tuning several hyperparameters and suffer from possible algorithmic degradation due to the approximate regularization and/or heuristic sparsity model. To overcome these drawbacks, in this article, we present a sparse Bayesian learning (SBL) framework for bearing fault diagnosis, and then propose two group-sparsity learning algorithms to extract fault impulses, where the first one exploits the group-sparsity of fault impulses only, whereas the second one utilizes additional periodicity behavior of fault impulses. Due to the inherent learning capability of the SBL framework, the proposed algorithms can tune hyperparameters automatically and do not require any prior knowledge. Another advantage is that our solutions are maximum <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a</i> <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$posteriori$</tex-math></inline-formula> estimators in the sense of Bayesian optimality, which can yield higher accuracy. Results on both simulated and real datasets demonstrate the superiority of the developed algorithms.