One-dimensional time-frequency dual-channel visual transformer for bearing fault diagnosis under strong noise and
Shaobin Cai1,2, Yuchen Wang3, Wanchen Cai4
1College of Information Engineering, Huzhou University, Huzhou, 313000, China.
Abstract:
In industrial settings, bearing health directly affects equipment stability, making accurate and efficient fault diagnosis critical for operational safety. Recently, Transformer models have been widely adopted in bearing fault diagnosis due to their strong global modeling capabilities. However, they still face significant challenges under strong noise and limited data. To address this, this paper proposes an end-to-end Vision Transformer with time-frequency fusion and dual attention across spatial and channel dimensions. The model adopts a dual-branch design: the time-domain branch incorporates spatial and channel attention to capture both local and global features, while the frequency-domain branch uses FFT to extract spectral information and fuses it with temporal features for efficient multi-scale modeling. To further enhance sensitivity to local patterns and periodic variations, a cross-scale convolution module and a periodic feedforward network are introduced. Experiments on the CWRU and PU datasets demonstrate that the proposed model achieves 99.42% and 98.14% accuracy, respectively, under noisy and data-scarce conditions. The results confirm superior noise robustness and diagnostic performance over recent state-of-the-art methods, highlighting its practical potential for real-world industrial applications.
More Related Videos
Related Concept Videos
Discrete Fourier Transform
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Continuous -time Fourier Transform
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Discrete-Time Fourier Series
For a discrete-time periodic signal x[n]...
Fast Fourier Transform
The computational efficiency of the FFT becomes...


