A fast inverse direct aperture optimization algorithm for intensity‐modulated radiation therapy
Bibliographic record
Abstract
PURPOSE: The goal of this work was to develop and evaluate a fast inverse direct aperture optimization (FIDAO) algorithm for IMRT treatment planning and plan adaptation. METHODS: A previously proposed fluence map optimization algorithm called fast inverse dose optimization (FIDO) was extended to optimize the aperture shapes and weights of IMRT beams. FIDO is a very fast fluence map optimization algorithm for IMRT that finds the global minimum using direct matrix inversion without unphysical negative beam weights. In this study, an equivalent second-order Taylor series expansion of the FIDO objective function was used, which allowed for the objective function value and gradient vector to be computed very efficiently during direct aperture optimization, resulting in faster optimization. To evaluate the speed gained with FIDAO, a proof-of-concept algorithm was developed in MATLAB using an interior-point optimization method to solve the reformulated aperture-based FIDO problem. The FIDAO algorithm was used to optimize four step-and-shoot IMRT cases: on the AAPM TG-119 phantom as well as a liver, prostate, and head-and-neck clinical cases. Results were compared with a conventional DAO algorithm that uses the same interior-point method but using the standard formulation of the objective function and its gradient vector. RESULTS: A substantial gain in optimization speed was obtained with the prototype FIDAO algorithm compared to the conventional DAO algorithm while producing plans of similar quality. The optimization time (number of iterations) for the prototype FIDAO algorithm vs the conventional DAO algorithm was 0.3 s (17) vs 56.7 s (50); 2.0 s (28) vs 134.1 s (57); 2.5 s (26) vs 180.6 s (107); and 6.7 s (20) vs 469.4 s (482) in the TG-119 phantom, liver, prostate, and head-and-neck examples, respectively. CONCLUSIONS: A new direct aperture optimization algorithm based on FIDO was developed. For the four IMRT test cases examined, this algorithm executed approximately 70-200 times faster without compromising the IMRT plan quality.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| 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.003 | 0.001 |
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".