Lichao Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lichao Yu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Huageng Luo
Xiamen University
5 shared publications - Chenglong Wang
School of Aerospace Engineering, Xiamen University, Xiamen, China
3 shared publications - Fanghong Zhang
National Center for Applied Mathematics in Chongqing, Chongqing Normal University, Chongqing, China
3 shared publications Chenglong Wang
2 shared publicationsBaoqiang Zhang
1 shared publication- Cunfu Wang
School of Aerospace Engineering, Xiamen University, Xiamen, China
1 shared publication
Latest Publications
- 17 March 2025
- Published by Elsevier in Signal Processing
- Vol. 234
Periodicity-constrained reweighted generalized minimax-concave regularization and its application in gearbox fault diagnosis
- 17 March 2025
- Published by Elsevier in Signal Processing
- Vol. 234
Periodicity-constrained reweighted generalized minimax-concave regularization and its application in gearbox fault diagnosis
- 5 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-12
Sparse Time–Frequency Representation via Greedy Method for Diagnosing Bearing Fault Under Variable Speed Conditions
Time-frequency analysis (TFA) is an effective tool for addressing the issue of bearing fault diagnosis under variable speed conditions. As a class of improved TFA methods, sparse time-frequency representation (STFR) enhances the detection capability for fault features through the pathway of sparse optimization. However, the existing STFR approaches necessitate the use of regularization, making the optimization results highly dependent on the selection of regularization parameters, and thus the optimization performance is difficult to guarantee. To overcome this drawback, a new STFR method using a sparsity adaptive matching pursuit by restricting atom distribution (SAMP-RAD) is proposed. This method resolves the optimization problem of STFR with an improved greedy algorithm, thereby freeing it from the issue of regularization parameter selection. Building upon orthogonal matching pursuit, SAMP-RAD introduces constraints on atom distribution to enhance noise suppression capabilities and achieves sparsity adaptation by limiting the maximum number of searches for feasible atoms. To accurately evaluate the performance of STFR methods, a new quantitative indicator is also introduced. The effectiveness of SAMP-RAD in overcoming parameter dependency while further enhancing TFA performance is verified with simulated and experimental bearing fault signals under variable speed conditions. Further comparison with other state-of-art methods validates the superiority of the proposed method.
- 5 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-12
Sparse Time–Frequency Representation via Greedy Method for Diagnosing Bearing Fault Under Variable Speed Conditions
Time-frequency analysis (TFA) is an effective tool for addressing the issue of bearing fault diagnosis under variable speed conditions. As a class of improved TFA methods, sparse time-frequency representation (STFR) enhances the detection capability for fault features through the pathway of sparse optimization. However, the existing STFR approaches necessitate the use of regularization, making the optimization results highly dependent on the selection of regularization parameters, and thus the optimization performance is difficult to guarantee. To overcome this drawback, a new STFR method using a sparsity adaptive matching pursuit by restricting atom distribution (SAMP-RAD) is proposed. This method resolves the optimization problem of STFR with an improved greedy algorithm, thereby freeing it from the issue of regularization parameter selection. Building upon orthogonal matching pursuit, SAMP-RAD introduces constraints on atom distribution to enhance noise suppression capabilities and achieves sparsity adaptation by limiting the maximum number of searches for feasible atoms. To accurately evaluate the performance of STFR methods, a new quantitative indicator is also introduced. The effectiveness of SAMP-RAD in overcoming parameter dependency while further enhancing TFA performance is verified with simulated and experimental bearing fault signals under variable speed conditions. Further comparison with other state-of-art methods validates the superiority of the proposed method.
- 5 June 2024
- Published by Elsevier in Journal of Sound and Vibration
- Vol. 590
Fault modulation mechanism and kinematic modeling of planetary gear with local fault
- 5 June 2024
- Published by Elsevier in Journal of Sound and Vibration
- Vol. 590
Fault modulation mechanism and kinematic modeling of planetary gear with local fault
- Open Access
Bearing Fault Diagnosis via Stepwise Sparse Regularization with an Adaptive Sparse Dictionary
Vibration monitoring is one of the most effective approaches for bearing fault diagnosis. Within this category of techniques, sparsity constraint-based regularization has received considerable attention for its capability to accurately extract repetitive transients from noisy vibration signals. The optimal solution of a sparse regularization problem is determined by the regularization term and the data fitting term in the cost function according to their weights, so a tradeoff between sparsity and data fidelity has to be made inevitably, which restricts conventional regularization methods from maintaining strong sparsity-promoting capability and high fitting accuracy at the same time. To address the limitation, a stepwise sparse regularization (SSR) method with an adaptive sparse dictionary is proposed. In this method, the bearing fault diagnosis is modeled as a multi-parameter optimization problem, including time indexes of the sparse dictionary and sparse coefficients. Firstly, sparsity-enhanced optimization is conducted by amplifying the regularization parameter, making the time indexes and the number of atoms adaptively converge to the moments when impulses occur and the number of impulses, respectively. Then, fidelity-enhanced optimization is carried out by removing the regularization term, thereby obtaining the high-precision reconstruction amplitudes. Simulations and experiments verify that the reconstruction accuracy of the SSR method outperforms other sparse regularization methods under most noise conditions, and thus the proposed method can provide more accurate results for bearing fault diagnosis.
Open AccessBearing Fault Diagnosis via Stepwise Sparse Regularization with an Adaptive Sparse Dictionary
Vibration monitoring is one of the most effective approaches for bearing fault diagnosis. Within this category of techniques, sparsity constraint-based regularization has received considerable attention for its capability to accurately extract repetitive transients from noisy vibration signals. The optimal solution of a sparse regularization problem is determined by the regularization term and the data fitting term in the cost function according to their weights, so a tradeoff between sparsity and data fidelity has to be made inevitably, which restricts conventional regularization methods from maintaining strong sparsity-promoting capability and high fitting accuracy at the same time. To address the limitation, a stepwise sparse regularization (SSR) method with an adaptive sparse dictionary is proposed. In this method, the bearing fault diagnosis is modeled as a multi-parameter optimization problem, including time indexes of the sparse dictionary and sparse coefficients. Firstly, sparsity-enhanced optimization is conducted by amplifying the regularization parameter, making the time indexes and the number of atoms adaptively converge to the moments when impulses occur and the number of impulses, respectively. Then, fidelity-enhanced optimization is carried out by removing the regularization term, thereby obtaining the high-precision reconstruction amplitudes. Simulations and experiments verify that the reconstruction accuracy of the SSR method outperforms other sparse regularization methods under most noise conditions, and thus the proposed method can provide more accurate results for bearing fault diagnosis.