Real-Time Voluntary Motion Prediction and Parkinson’s Tremor Reduction Using Deep Neural Networks
Bibliographic record
Abstract
Wearable tremor suppression devices (WTSD) have been considered as a viable solution to manage parkinsonian tremor. WTSDs showed their ability to improve the quality of life of individuals suffering from parkinsonian tremor, by helping them to perform activities of daily living (ADL). Since parkinsonian tremor has been shown to be nonstationary, nonlinear, and stochastic in nature, the performance of the tremor models used by WTSDs is affected by their inability to adapt to the nonlinear behaviour of tremor. Another drawback that the models have is their limitation to estimate or predict one step ahead, which introduces delay when used in real time with WTSDs, which compromises performance. To address these issues, this work proposes a deep neural network model that learns the correlations and nonlinearities of tremor and voluntary motion, and is capable of multi-step prediction with minimal delay. A generalized model that is task and user-independent is presented. The model achieved an average estimation percentage accuracy of 99.2%. The average future voluntary motion prediction percentage accuracy with 10, 20, 50, and 100 steps ahead was 97.0%, 94.0%, 91.6%, and 89.9%, respectively, with prediction time as low as 1.5 ms for 100 steps ahead. The proposed model also achieved an average of 93.8% ± 1.5% in tremor reduction when it was tested in an experimental setup in real time. The tremor reduction showed an improvement of 25% over the Weighted Fourier Linear Combiner (WFLC), an estimator commonly used with WTSDs.
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.000 |
| Open science | 0.000 | 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".