Localization of Active Pathways in Peripheral Nerves: A Simulation Study
Bibliographic record
Abstract
A methodology is investigated for determining the location of active pathways in a peripheral nerve using measurements from a multicontact cuff electrode. The problem is treated as an inverse problem of source localization and solved using the sLORETA algorithm, developed for the electroencephalogram/magnetoencephalogram source localization problem. Simulated measurements are generated corresponding to action potentials traveling along either one or three pathways in a rat sciatic nerve. The performance of the proposed methodology using these measurements is evaluated in terms of localization error, missed pathways, and spurious pathways. The source localization performance when assuming an idealized nerve anatomy is compared to that when the correct anatomy is known. The effect of a spatio-temporal constraint based on the nerve anatomy and electrophysiology is also investigated. The approach in its present form was not found to be sufficiently reliable for subfascicular localization in practice, due to mean localization errors in the 140-180 mum range, high numbers of spurious pathways, and low resolution. Nonetheless, the constraints were shown to produce a marked reduction in the number of spurious pathways. Conditions under which the source localization approach may be useful for peripheral nerves are discussed.
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.002 |
| 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.001 | 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".