Fault Diagnosis of Electric Motors by a Channel-Wise Regulated CNN and Differential of STFT
Bibliographic record
Abstract
In various applications, the reliable and efficient detection of faults in electric machines is crucial, particularly in environments with high noise levels. To this end, the current study introduces an effective fault detection model utilizing the differential of Short-Time Fourier Transform (STFT) and a channel-wise regulated Convolutional Neural Network (CNN). The novel use of the differential of STFT is presented to enhance the diagnostic model's performance in noisy conditions compared with the conventional STFT. According to the inherent time-frequency domain information within the differential of STFT, a regulated CNN-based model is proposed to integrate spatio-temporal information into the feature map, thereby enhancing accuracy and reducing the computational demand. The method is evaluated on three datasets: the widely used Case Western Reserve University (CWRU) benchmark featuring bearing fault and vibration measurements, a dataset involving Permanent Magnet Synchronous Motor (PMSM) data with varying levels of Inter-Turn Short-Circuit (ITSC) fault and current measurements, and a dataset consisting of a mixture of mechanical and electrical faults. Comparative analysis highlights the superior performance of the proposed model over existing robust methods in the literature under both normal and noisy 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.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".