Electrode-shift tolerant myoelectric movement-pattern classification using extreme learning for adaptive sparse representations
Bibliographic record
Abstract
Myoelectric signal patterns can be used to predict the intended movements of amputees for prosthesis activation. Real-world prosthesis use introduces a variety of unpredictable conditional influences on these patterns, hindering the performance of classification algorithms and potentially leading to device abandonment. We have discovered a state-of-the-art classification method which is significantly more tolerant to these conditional influences. In our prior work, we presented a robust sparsity-based adaptive classification method that is tolerant to pattern deviations resulting from untrained limb positions and the prosthesis load. Herein, we demonstrate that this method is tolerant to the shifting or misalignment of the contact-electrode array which occurs during prosthesis use. We demonstrate the robustness of this approach in untrained electrode-site locations for amputee and able-bodied subjects, and report significant performance improvements over conventional myoelectric pattern recognition approaches. By showing that a single, unified method is robust across a variety of real-world condition spaces, clinicians are more likely to incorporate this method into myoelectric prosthesis controllers, resulting in improved utility and increased adoption among amputee users.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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.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".