HMFP-DBRNN: Real-Time Hand Motion Filtering and Prediction via Deep Bidirectional RNN
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Pathological hand tremor (PHT) is among the most common movement symptoms of several neurological disorders including Parkinson's disease and essential tremor. Extracting PHT is of paramount importance in several engineering and clinical applications such as assistive and robotic rehabilitation technologies. In such systems, PHT is modeled as the input noise to the system and thus there is a surge of interest in estimation an compensation of the noise. Although various works in the literature have attempted to estimate and extract the PHT, in this letter, first, we argue that the ground truth signal used in existing works to optimize the performance of tremor extraction techniques is not accurate enough, and thus the performance measures for the prior techniques are not perfectly reliable. In addition, most of the existing tremor extraction techniques impose unrealistic assumptions, which are, typically, violated in practical settings. This letter proposes a novel technique that for the first time incorporates deep bidirectional recurrent neural networks as a processing tool for PHT extraction. Moreover, we devise an intuitively pleasing training strategy that enables the network to perform not only online estimation but also online prediction of the voluntary hand motion in a myopic fashion, which is currently a significantly important unmet need for rehabilitative and assistive robotic technologies designed for patients with pathological tremor.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| 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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it