Real-time multi-peak tractography for instantaneous connectivity display
Bibliographic record
Abstract
The computerized process of reconstructing white matter tracts from diffusion MRI (dMRI) data is often referred to as tractography. Tractography is nowadays central in structural connectivity since it is the only non-invasive technique to obtain information about brain wiring. Most publicly available tractography techniques and most studies are based on a fixed set of tractography parameters. However, the scale and curvature of fiber bundles can vary from region to region in the brain. Therefore, depending on the area of interest or subject (e.g., healthy control vs. tumor patient), optimal tracking parameters can be dramatically different. As a result, a slight change in tracking parameters may return different connectivity profiles and complicate the interpretation of the results. Having access to tractography parameters can thus be advantageous, as it will help in better isolating those which are sensitive to certain streamline features and potentially converge on optimal settings which are area-specific. In this work, we propose a real-time fiber tracking (RTT) tool which can instantaneously compute and display streamlines. To achieve such real-time performance, we propose a novel evolution equation based on the upsampled principal directions, also called peaks, extracted at each voxel of the dMRI dataset. The technique runs on a single Computer Processing Unit (CPU) without the need for Graphical Unit Processing (GPU) programming. We qualitatively illustrate and quantitatively evaluate our novel multi-peak RTT technique on phantom and human datasets in comparison with the state of the art offline tractography from MRtrix, which is robust to fiber crossings. Finally, we show how our RTT tool facilitates neurosurgical planning and allows one to find fibers that infiltrate tumor areas, otherwise missing when using the standard default tracking parameters.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| 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.010 | 0.002 |
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".