An Optimization Tendency Guiding Mode Decomposition Method for Bearing Fault Detection Under Varying Speed Conditions
Bibliographic record
Abstract
Tacholess order tracking techniques based on time-frequency (TF) ridge detection have been extensively used in bearing fault diagnosis under varying speed conditions for decades. However, the signal components of a fault bearing related to shaft rotational frequency (SRF) is difficult to be accurately extracted by these methods because of TF resolution limitation and strong noise interference. A new TF decomposing algorithm, that is, variational nonlinear chirp mode decomposition (VNCMD) is effective to extract the time-varying feature under limited TF resolution. However, its performance is influenced by prior knowledge of initial parameters. Besides, ridge information hidden in noise is difficult to be mined effectively, which increases the difficulty of ridge extraction. In this study, a feature isolation technology is proposed to enhance fault-related features and reduce the interference of noise and irrelevant components. Then inspired by the decomposing properties research on the convergence characteristics of VNCMD, an optimization tendency guiding mode decomposition (OTGMD) method is proposed to track the instantaneous frequency (IF) of fault-related mode, which can alleviate the personnel experience requirement and is not affected by the set of TF resolution. The proposed method mainly consists of three steps. First, SRF-related information is highlighted through low-pass filtering, and the dominant IF is achieved through ridge detection method. Subsequently, for the convenience of mode extraction, the fault characteristic is augmented through iterative envelope analysis. Then, the OTGMD optimization strategy is developed to gradually decompose the target mode on the basis of the above process. Finally, a stopping criterion based on characteristic frequency ratios (CFRs) is constructed to adaptively terminate the iteration process. Simulation and experiments demonstrate that the proposed method is effective and suitable for bearing fault diagnosis under varying speed conditions.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".