A vibration transfer path analysis based TFR-ViT model for fault diagnosis of aero-engine rotor
Source abstract
Abstract
In the rotor condition monitoring of aero-engines, the presence of the casing dictates that vibration measurement locations are typically distant from the actual fault source. Given the complex transmission paths, rotor fault diagnosis is significantly hindered by signal attenuation, multi-source interference, and the scarcity of labelled fault samples. To address these challenges, a rotor fault diagnosis method based on Time-Frequency Representation (TFR) and Vision Transformer (ViT) is proposed. In this framework, Short-Time Fourier Transform (STFT) is applied to represent raw signals in the time-frequency domain. The ViT model is specifically employed to overcome transmission path interference. By utilising its inherent Self-Attention mechanism, global dependencies are captured and higher diagnostic weights are dynamically assigned to fault-related features while suppressing background noise. To mitigate training costs and the limitations of small datasets, pre-trained models are introduced, and the impact of varying network depths on diagnostic accuracy is systematically evaluated. The proposed method is validated through simulation studies on a gas generator rotor system, and an aero-engine simulation models under diverse speed conditions. Finally, the experimental validation of unbalance fault diagnosis on a real aero-engine rotor demonstrates that even under complex transmission paths, the proposed method achieves high-accuracy diagnostic performance.
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Machine Fault Diagnosis Techniques · Vehicle Noise and Vibration Control · Magnetic Bearings and Levitation Dynamics
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Nanjing Forestry University
Funding
National Natural Science Foundation of China
References (49)
Show source-provided references
1. 10.1016/j.engappai.2024.10949910.1016/j.engappai.2024.109499 ↗
2. 10.1007/s10462-020-09910-w10.1007/s10462-020-09910-w ↗
3. 10.1177/1475921725132411310.1177/14759217251324113 ↗
4. 10.1080/10589759.2024.244081810.1080/10589759.2024.2440818 ↗
5. 10.1016/j.ymssp.2025.11340810.1016/j.ymssp.2025.113408 ↗
6. 10.1016/j.psep.2007.10.01410.1016/j.psep.2007.10.014 ↗
7. 10.1109/TII.2022.317744710.1109/TII.2022.3177447 ↗
8. 10.1177/1077546321105017210.1177/10775463211050172 ↗
9. 10.1007/s41060-024-00670-210.1007/s41060-024-00670-2 ↗
10. 10.1016/j.ymssp.2018.12.02210.1016/j.ymssp.2018.12.022 ↗
11. 10.1177/107754631350250510.1177/1077546313502505 ↗
12. 10.1016/j.compeleceng.2020.10675210.1016/j.compeleceng.2020.106752 ↗
13. 10.1007/s10489-019-01516-210.1007/s10489-019-01516-2 ↗
14. 10.1016/j.ymssp.2025.11346310.1016/j.ymssp.2025.113463 ↗
15. 10.1016/j.engappai.2025.11130610.1016/j.engappai.2025.111306 ↗
16. 10.1109/JSEN.2023.332800710.1109/JSEN.2023.3328007 ↗
17. 10.1088/1361-6501/ac161310.1088/1361-6501/ac1613 ↗
18. 10.1088/1361-6501/ad8c7210.1088/1361-6501/ad8c72 ↗
19. 10.1109/TIM.2021.313970610.1109/TIM.2021.3139706 ↗
20. 10.1016/j.measurement.2022.11235010.1016/j.measurement.2022.112350 ↗
21. 10.1088/1361-6501/ac491e10.1088/1361-6501/ac491e ↗
22. 10.1016/j.compind.2020.10338510.1016/j.compind.2020.103385 ↗
23. 10.1109/TII.2020.300596510.1109/TII.2020.3005965 ↗
24. 10.1016/j.engfailanal.2022.10642410.1016/j.engfailanal.2022.106424 ↗
25. 10.1088/1361-6501/acf2b110.1088/1361-6501/acf2b1 ↗
26. 10.1109/TCYB.2025.363087910.1109/TCYB.2025.3630879 ↗
27. 10.1016/j.ymssp.2024.11154410.1016/j.ymssp.2024.111544 ↗
28. 10.1016/j.knosys.2025.11298210.1016/j.knosys.2025.112982 ↗
29. 10.1080/10589759.2024.242581310.1080/10589759.2024.2425813 ↗
30. Vaswani A, Shazeer N, Parmar N, et al. Attention is all you need. In: Proceedings of the 31st International Conference on Neural Information Processing Systems; Red Hook, (NY), USA. Curran Associates Inc; 2017. p. 6000–6010.
31. Shazeer N, Mirhoseini A, Maziarz K, et al. Outrageously large Neural networks: the sparsely-Gated mixture-of-experts layer. In: International Conference on Learning Representations; Toulon, France. 2017. https://openreview.net/forum?id=B1ckMDqlg
32. 10.1109/TNNLS.2022.319036710.1109/TNNLS.2022.3190367 ↗
33. Dosovitskiy A Beyer L Kolesnikov A et al. An image is worth 16x16 words: transformers for image recognition at scale. 2020.
34. 10.1109/TSMC.2024.352370810.1109/TSMC.2024.3523708 ↗
35. 10.1109/ACCESS.2023.326853410.1109/ACCESS.2023.3268534 ↗
36. 10.1016/j.ymssp.2021.10861610.1016/j.ymssp.2021.108616 ↗
37. 10.1109/JSEN.2024.338000210.1109/JSEN.2024.3380002 ↗
38. 10.1016/j.jpowsour.2024.23561010.1016/j.jpowsour.2024.235610 ↗
39. 10.1088/1361-6501/acd2f310.1088/1361-6501/acd2f3 ↗
40. 10.1109/TIM.2024.350282110.1109/TIM.2024.3502821 ↗
41. 10.1177/1475921725132467110.1177/14759217251324671 ↗
42. 10.1016/j.compind.2025.10438110.1016/j.compind.2025.104381 ↗
43. 10.48550/arXiv.1607.0645010.48550/arXiv.1607.06450 ↗
44. 10.1109/CVPR.2016.9010.1109/CVPR.2016.90 ↗
45. Bahdanau D Cho K Bengio Y. Neural machine translation by jointly learning to align and translate. In: International Conference on Learning Representations; San Diego California USA. 2015.
46. Srivastava N Hinton GE Krizhevsky A et al. Dropout: a simple way to prevent neural networks from overfitting. J Mach Learn Res. 2014; 15(1): 1929–1958
47. 10.1016/j.jsv.2025.11962710.1016/j.jsv.2025.119627 ↗
48. 10.1016/j.neucom.2012.11.01010.1016/j.neucom.2012.11.010 ↗
49. 10.1016/j.measurement.2020.10819110.1016/j.measurement.2020.108191 ↗