Weak Fault Detection of Tapered Rolling Bearing Based on Penalty Regularization Approach
AbstractAimed at the issue of estimating the fault component from a noisy observation, a novel detection approach based on augmented Huber non-convex penalty regularization (AHNPR) is proposed. The core objectives of the proposed method are that (1) it estimates non-zero singular values (i.e., fault component) accurately and (2) it maintains the convexity of the proposed objective cost function (OCF) by restricting the parameters of the non-convex regularization. Specifically, the AHNPR model is expressed as the L1-norm minus a generalized Huber function, which avoids the underestimation weakness of the L1-norm regularization. Furthermore, the convexity of the proposed OCF is proved via the non-diagonal characteristic of the matrix BTB, meanwhile, the non-zero singular values of the OCF is solved by the forward–backward splitting (FBS) algorithm. Last, the proposed method is validated by the simulated signal and vibration signals of tapered bearing. The results demonstrate that the proposed approach can identify weak fault information from the raw vibration signal under severe background noise, that the non-convex penalty regularization can induce sparsity of the singular values more effectively than the typical convex penalty (e.g., L1-norm fused lasso optimization (LFLO) method), and that the issue of underestimating sparse coefficients can be improved. View Full-Text
Share & Cite This Article
Li, Q.; Liang, S.Y. Weak Fault Detection of Tapered Rolling Bearing Based on Penalty Regularization Approach. Algorithms 2018, 11, 184.
Li Q, Liang SY. Weak Fault Detection of Tapered Rolling Bearing Based on Penalty Regularization Approach. Algorithms. 2018; 11(11):184.Chicago/Turabian Style
Li, Qing; Liang, Steven Y. 2018. "Weak Fault Detection of Tapered Rolling Bearing Based on Penalty Regularization Approach." Algorithms 11, no. 11: 184.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.