No abstract

The Gini index (GI), GI II, and GI III are proven to be effective sparsity measures in the fields of machine condition monitoring and fault diagnosis, and they can be reformulated as the ratio of different quasi-arithmetic means (RQAM). Under this framework, generalized Gini indices (GGIs) have been developed for sparse quantification by applying nonlinear weights to GI, and another generalized form of GI, referred to here as power function-based Gini indices I (PFGI1s), has been introduced by using power function as the generator of quasi-arithmetic means. The GGIs with different weight parameters exhibit reliable sparse quantization capability for repetitive transient features, while their repetitive transient discriminability is lower than kurtosis and negentropy under noise contamination. PFGI1 achieves enhanced repetitive transient discriminability with increasing power exponent, showing the advantage of the generalization approach. In this paper, based on RQAM, a single-parameter generalization method for generating PFGI1s is introduced into GI II and GI III from the perspective of the quasi-arithmetic mean generator, which leads to the power function-based Gini indices II and III (PFGI2s and PFGI3s) constructed from GI II and GI III, respectively. Mathematical derivation proves that PFGI2s and PFGI3s satisfy at least five of six typical attributes of sparsity measures and are two new families of sparsity measures. Simulation analysis shows that, similar to PFGI1s, PFGI2s and PFGI3s can monotonically estimate the sparsity of the data sequence and can simultaneously achieve strong random transient resistibility and high repetitive transient discriminability compared with traditional sparsity measures. The experimental results of bearing run-to-failure demonstrate that PFGI1s, PFGI2s, and PFGI3s with appropriate power exponents can effectively quantify the repetitive transient features caused by bearing faults and can accurately characterize the bearing degradation status compared with the state-of-the-art sparsity measures.

Blind deconvolution (BD) has proven to be an effective approach to detecting repetitive transients caused by bearing faults. However, BD suffers from instability issues including excessive sensitivity of kurtosis-guided BD methods to the single impulse and high computational time cost of the eigenvector algorithm-aided BD methods. To address these critical issues, this paper proposed a novel BD method maximizing negative entropy (NE), shortened as maximum negative entropy deconvolution (MNED). MNED utilizes NE instead of kurtosis as the optimization metric and optimizes the filter coefficients through the objective function method. The effectiveness of MNED in enhancing repetitive transients is illustrated through a simulation case and two experimental cases. A quantitative comparison with three existing BD methods demonstrates the advantages of MNED in fault detection and computational efficiency. In addition, the performance of the four methods under different filter lengths and external shocks is compared. MNED exhibits lower sensitivity to random impulse noise than the kurtosis-guided BD methods and higher computational efficiency than the BD methods based on the eigenvalue algorithm. The simulation and experimental results demonstrate that MNED is a robust and cost-effective method for bearing fault diagnosis and condition monitoring.

No abstract

No abstract