A novel transport sweep architecture for efficient deterministic patient dose calculations in MRI-guided radiotherapy
Bibliographic record
Abstract
Accurate and efficient patient dose calculations are essential for treatment planning in magnetic resonance imaging guided radiotherapy (MRIgRT). Achieving reasonable performance for a space-angle discontinuous finite element method (DFEM) grid based Boltzmann solver (GBBS) with magnetic fields for clinical MRIgRT applications largely depends on how the transport sweep is orchestrated. Compared to classical Discrete Ordinates, DFEM in angle introduces increased angular degrees of freedom and eliminates ray-effect artifacts. However, the inclusion of magnetic fields introduces additional serial dependencies such that parallelization of the space-angle transport sweeps becomes more challenging. Novel techniques for the transport sweep and right-hand source assembly are developed, predicated on limiting the number of bulk material densities modeled in the transport sweep scatter calculations. Specifically, k-means clustering is used to assign sub-intervals of mass-density for each spatial element to execute the scatter-dose calculations using batched multiplication by pre-inverted transport sweep matrices. This is shown to be two orders of magnitude more efficient than solving each elemental system individually at runtime. Even with discrete material densities used in the transport sweep scatter calculations, accuracy is maintained by optimizing the material density assignments using k-means clustering, and by performing the primary photon fluence calculations (ray-tracing) using the underlying continuous density of the computed tomography (CT) image. In the presence of 0.5 T parallel and 1.5 T perpendicular magnetic fields, this approach demonstrates high levels of accuracy with gamma 1%/1 mm passing rates exceeding 94% across a range of anatomical sites compared to GEANT4 Monte Carlo dose calculations which used continuous densities. This deterministic GBBS approach maintains unconditional stability, produces no ray-effect artifacts, and has the benefit of no statistical uncertainty. Runtime on a non-parallelized Matlab implementation averaged 10 min per beam averaging 80 000 spatial elements, paving way for future development based on this algorithmically efficient paradigm.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".