The use of ensemble empirical mode decomposition to improve bispectral analysis for fault detection in rotating machinery
Bibliographic record
Abstract
Empirical mode decomposition (EMD) has been widely applied to analyse signals for the detection of faults in rotating machinery. However, sometimes, it cannot reveal signal characteristics accurately because of the mode mixing problem. Ensemble empirical mode decomposition (EEMD) was developed recently to alleviate the mode mixing problem of EMD. With EEMD, components that are physically meaningful can be extracted from the signals. Bispectrum, a third-order statistic, helps identify phase coupling effects, which are useful for detecting faults in rotating machinery. Utilizing the advantages of EEMD and bispectrum, this article proposes a joint method for detecting such faults. First, original vibration signals collected from rotating machinery are decomposed by EEMD and a set of intrinsic mode functions (IMFs) is produced. Then, the IMFs are reconstructed into new signals using the weighted reconstruction algorithm developed in this article. Finally, the reconstructed signals are analysed via bispectrum to detect faults. The simulation experiments and the physical experiments of two gears with a chipped tooth and a cracked tooth, respectively, demonstrate that the proposed method can detect faults more clearly than can directly performing bispectrum on the original vibration signals.
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.004 |
| 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.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".