Algorithm for Multiple Time-Frequency Curve Extraction From Time-Frequency Representation of Vibration Signals for Bearing Fault Diagnosis Under Time-Varying Speed Conditions
Bibliographic record
Abstract
Bearing fault diagnosis under constant operational condition has been widely investigated. Monitoring the bearing vibration signal in the frequency domain is an effective approach to diagnose a bearing fault since each fault type has a specific Fault Characteristic Frequency (FCF). However, in real applications, bearings are often running under time-varying speed conditions which makes the signal non-stationary and the FCF time-varying. Order tracking is a commonly used method to resample the non-stationary signal to a stationary signal. However, the accuracy of order tracking is affected by many factors such as the precision of the measured shaft rotating speed and the interpolation methods used. Therefore, resampling-free methods are of interest for bearing fault diagnosis under time-varying speed conditions. With the development of Time-Frequency Representation (TFR) techniques, such as the Short-Time Fourier Transform (STFT) and wavelet transform, bearing fault characteristics can be shown in the time-frequency domain. However, for bearing fault diagnosis, instantaneous time-frequency characteristics, i.e. Time-Frequency (T-F) curves, have to be extracted from the TFR. In this paper, an algorithm for multiple T-F curve extraction is proposed based on a path-optimization approach to extract T-F curves from the TFR of the bearing vibration signal. The bearing fault can be diagnosed by matching the curves to the Instantaneous Fault Characteristic Frequency (IFCF) and its harmonics. The effectiveness of the proposed algorithm is validated by experimental data collected from a faulty bearing with an outer race fault and a faulty bearing with an inner race fault, respectively.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".