Synchronous fault feature extraction for rolling bearings in a generalized demodulation framework
Bibliographic record
Abstract
Abstract Generalized demodulation (GD) has the potential to process non-stationary vibration signals since it can demodulate a signal with a curved time–frequency (TF) ridge into a signal, with a TF ridge parallel to a time axis with an improved time-frequency representation (TFR) energy concentration level. However, current GD methods require iteration operations and cannot simultaneously deal with vibrations from multiple components of rolling bearings. This paper proposes a method based on the GD framework, which can simultaneously demodulate multiple components of interest using the Hadamard product between matrices. A synchronous extractor is also constructed to post-process TFRs of generalized demodulated signals to further improve the TF aggregation. Unlike the conventional synchronous extraction transform, the synchronous extractor in this paper can be directly applied to TF ridges parallel to the time axis without the estimation of instantaneous frequencies (IFs). Then, the post-processed TF ridges are backward demodulated to restore the actual IF. The proposed synchronous fault feature extraction method in the GD framework also allows for the signal reconstruction. Both simulated and experimental signals are applied to validate the effectiveness of the proposed method for rolling bearing fault diagnosis.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".