Edge Solution for Real-Time Motor Fault Diagnosis Based on Efficient Convolutional Neural Network
Bibliographic record
Abstract
Real-time motor fault diagnosis can detect motor faults on time and prompt the repair or replacement of faulty motors which minimizes the potential losses caused by motor faults. Deep learning (DL) methods have been intensively applied in motor fault diagnosis. Most DL algorithms need to be trained with sufficient computation resources on cloud or local servers. However, uploading the raw data and downloading the command instructions to the edge will cause inevitable time delays and security concerns. This paper develops a DL algorithm based on efficient convolutional neural networks (ECNN) that can be deployed on an edge computing node for real-time motor fault diagnosis and dynamic control. The effectiveness, efficiency, and robustness of the ECNN model have been validated by experiments, and the results indicate that the ECNN model can achieve 100 % accuracy in recognition of 10 types of motor conditions, with the inference time and memory usage less than 14 ms and 44 KiB, respectively. The comparison results demonstrate that the ECNN model yields higher accuracy than the classical shallow neural networks, and it also presents the advantages of smaller model volume, lower prediction time, and higher accuracy as compared with the DL models. The proposed method shows significant potential for practical application in real-time motor fault detection and control.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".