3D Stochastic Completion Fields for Mapping Connectivity in Diffusion MRI
Bibliographic record
Abstract
The 2D stochastic completion field algorithm, introduced by Williams and Jacobs [1], [2], uses a directional random walk to model the prior probability of completion curves in the plane. This construct has had a powerful impact in computer vision, where it has been used to compute the shapes of likely completion curves between edge fragments in visual imagery. Motivated by these developments, we extend the algorithm to 3D, using a spherical harmonics basis to achieve a rotation invariant computational solution to the Fokker-Planck equation describing the evolution of the probability density function underlying the model. This provides a principled way to compute 3D completion patterns and to derive connectivity measures for orientation data in 3D, as arises in 3D tracking, motion capture, and medical imaging. We demonstrate the utility of the approach for the particular case of diffusion magnetic resonance imaging, where we derive connectivity maps for synthetic data, on a physical phantom and on an in vivo high angular resolution diffusion image of a human brain.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".