Integrating DVH criteria into a column generation algorithm for VMAT treatment planning
Bibliographic record
Abstract
Volumetric-modulated arc therapy (VMAT) treatment planning is an efficient treatment technique with a high degree of flexibility in terms of dose rate, gantry speed, and aperture shapes during rotation around the patient. However, the dynamic nature of VMAT results in a large-scale nonconvex optimization problem. Determining the priority of the tissues and voxels to obtain clinically acceptable treatment plans poses additional challenges for VMAT optimization. The main purpose of this paper is to develop an automatic planning approach integrating dose-volume histogram (DVH) criteria in direct aperture optimization for VMAT, by adjusting the model parameters during the algorithm. The proposed algorithm is based on column generation, an optimization technique that sequentially generates the apertures and optimizes the corresponding intensities. We take the advantage of iterative procedure in this method to modify the weight vector of the penalty function based on the DVH criteria and decrease the use of trial-and-error in the search for clinically acceptable plans. We evaluate the efficiency of the algorithm and treatment quality using a clinical prostate case and a challenging head-and-neck case. In both cases, we generate 15 random initial weight vectors to assess the robustness of the algorithm. In the prostate case, our methodology obtained clinically acceptable plans in all instances with only a 10% increase in the computational time, while simple VMAT optimization found just three acceptable plans. To have an idea with respect to the existing software, we compared the obtained DVH to a commercial software. The quality of the diagrams of the proposed method, especially for the healthy tissues, is significantly better while the computational time is less. In the head-and-neck case, 93.3% of the clinically acceptable plans are obtained while no plan was acceptable in simple VMAT. In sum, the results demonstrate the ability of the proposed optimization algorithm to obtain clinically acceptable plans without human intervention and also its robustness to weight parameters. Moreover, our proposed weight adjustment procedure proves to reduce the symmetry in the solution space and the time required for the post-optimization phase.
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.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.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".