A computational optimization approach for the automatic generation of Gamma Knife radiosurgery treatment plans
Bibliographic record
Abstract
Gamma Knife (GK) radiosurgery is a non-invasive treatment modality which allows single fraction delivery of focused radiation to one or more brain targets. Treatment planning mostly involves manual placement and shaping of shots to conform the prescribed dose to a surgical target. This process can be time consuming and labour intensive. An automated method is needed to determine the optimum combination of treatment parameters to decrease planning time and chance for operator-related error. Recent advancements in hardware platforms which employ parallel computational methods with stochastic optimization schemes are well suited to solving such combinatorial optimization problems efficiently. We present a method of generating optimized GK radiosurgery treatment plans using these techniques, which we name ROCKET (Radiosurgical Optimization Configuration Kit for Enhanced Treatments). Our approach consists of two phases in which shot isocenter positions are generated based on target geometry, followed by optimization of sector collimator parameters. Using this method, complex treatment plans can be generated, on average, in less than one minute, a substantial decrease relative to manual planning. Our results also demonstrate improved selectivity and treatment safety through decreased exposure to nearby organs-at-risk (OARs), compared to manual reference plans with matched coverage. Stochastic optimization is therefore shown to be a robust and efficient clinical tool for the automatic generation of GK radiosurgery treatment plans.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".