A marker registration method to improve joint angles computed by constrained inverse kinematics
Bibliographic record
Abstract
Accurate computation of joint angles from optical marker data using inverse kinematics methods requires that the locations of markers on a model match the locations of experimental markers on participants. Marker registration is the process of positioning the model markers so that they match the locations of the experimental markers. Markers are typically registered using a graphical user interface (GUI), but this method is subjective and may introduce errors and uncertainty to the calculated joint angles and moments. In this investigation, we use OpenSim to isolate and quantify marker registration-based error from other sources of error by analyzing the gait of a bipedal humanoid robot for which segment geometry, mass properties, and joint angles are known. We then propose a marker registration method that is informed by the orientation of anatomical reference frames derived from surface-mounted optical markers as an alternative to user registration using a GUI. The proposed orientation registration method reduced the average root-mean-square error in both joint angles and joint moments by 67% compared to the user registration method, and eliminated variability among users. Our results show that a systematic method for marker registration that reduces subjective user input can make marker registration more accurate and repeatable.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".