Self-Matching Chirplet Extraction Transform: A Novel Tool for Dense Multicomponent Signals Analysis and Machinery Fault Diagnosis
Bibliographic record
Abstract
This study introduces a novel time–frequency (TF) analysis methodology, designated as the self-matching chirplet extraction transform (SMCET). This innovative technique is specifically crafted for the analysis of nonstationary signals characterized by dense multicomponents, aimed at achieving an accurate TF representation (TFR). SMCET extends chirplet transform (CT) by employing parameterized phase kernels with higher order expansions, which accurately fits the instantaneous frequencies (IFs) of nonlinear variations, thereby achieving precise matching between chirprate and varying frequency. This technique effectively resolves the issue of TF resolution ambiguity, a challenge encountered by CT-improved algorithms, when processing dense components. The optimization strategy for self-matching parameter significantly enhances both precision of matching and computational efficiency by narrowing the traversal range of chirprate angle. By combining IF estimate with the matching extraction operator (MEO), a higher quality TFR can be obtained, even in the case of noise interference. The efficacy of SMCET is convincingly demonstrated via numerical and experimental analyses, focusing on vibration signals of bearing and planetary gearbox. The analytical outcomes reveal that SMCET exhibits superior capabilities in characterizing nonlinear multicomponent signals, including those with dense components. This underlines its significant potential for accurate fault diagnosis on rotary machinery.
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.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".