Real-Time Quality Inspection of Motor Rotor Using Cost-Effective Intelligent Edge System
Bibliographic record
Abstract
Induction motors (IMs) are used extensively as driving actuators in electric vehicles. Motor rotors are prone to defects in the die casting procedure, which can significantly reduce the production quality. Benefitting from the development of Internet of Things (IoT) techniques and edge computing, this study designed an instrumentation system for the fast inspection of rotor defects to meet the objectives of efficient and high-quality rotor production. First, an electromagnetic sensing device is designed to acquire the induced voltage signal of the rotor under investigation. Second, a residual multiscale feature fusion convolutional neural network model is designed to extract the hierarchical features of the signal, to facilitate defect recognition. The developed algorithm is deployed into a cost-effective edge computing node that includes a signal acquisition circuit and a Raspberry Pi microcontroller. The conducted experimental studies show that this implementation can achieve an inference time of less than 200 ms and accuracy of more than 99%. It is shown that the designed system exhibits superior performance when compared with conventional methods. The developed, compact and flexible handheld solution with enhanced deep learning techniques shows outstanding potential for use in real-time rotor defect detection.
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.000 | 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.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".