PubMed Health⌕ Search

PubMed · 16289912

Simultaneous beam geometry and intensity map optimization in intensity-modulated radiation therapy.

Abstract

PURPOSE: In current intensity-modulated radiation therapy (IMRT) plan optimization, the focus is on either finding optimal beam angles (or other beam delivery parameters such as field segments, couch angles, gantry angles) or optimal beam intensities. In this article we offer a mixed integer programming (MIP) approach for simultaneously determining an optimal intensity map and optimal beam angles for IMRT delivery. Using this approach, we pursue an experimental study designed to (a) gauge differences in plan quality metrics with respect to different tumor sites and different MIP treatment planning models, and (b) test the concept of critical-normal-tissue-ring--a tissue ring of 5 mm thickness drawn around the planning target volume (PTV)--and its use for designing conformal plans. METHODS AND MATERIALS: Our treatment planning models use two classes of decision variables to capture the beam configuration and intensities simultaneously. Binary (0/1) variables are used to capture "on" or "off" or "yes" or "no" decisions for each field, and nonnegative continuous variables are used to represent intensities of beamlets. Binary and continuous variables are also used for each voxel to capture dose level and dose deviation from target bounds. Treatment planning models were designed to explicitly incorporate the following planning constraints: (a) upper/lower/mean dose-based constraints, (b) dose-volume and equivalent-uniform-dose (EUD) constraints for critical structures, (c) homogeneity constraints (underdose/overdose) for PTV, (d) coverage constraints for PTV, and (e) maximum number of beams allowed. Within this constrained solution space, five optimization strategies involving clinical objectives were analyzed: optimize total intensity to PTV, optimize total intensity and then optimize conformity, optimize total intensity and then optimize homogeneity, minimize total dose to critical structures, minimize total dose to critical structures and optimize conformity simultaneously. We emphasize that the objectives that include optimizing conformity make use of the critical-normal-tissue-ring. Three tumor sites: head-and-neck, pediatric brain, and prostate are used for comparison. RESULTS: The critical-normal-tissue-ring acts as a good device for enforcing conformity. Trends in the characteristics and quality of plans resulting from each model were observed. Attempts to reduce dose to critical structures tend to worsen PTV conformity (1.542 to 3.092) and homogeneity (1.223 to 1.984), depending on the relative size and spatial distance of the critical structures to the PTV. When the critical structures are relatively small compared with the PTV (as in the case for the pediatric brain tumor, where each is less than 15% in volume), dose reduction to critical structures is accompanied by much worse scores in conformity (2.482) and homogeneity (1.984). When the critical structures are larger, as in the case of head-and-neck (approximately 50%), the conformity and homogeneity deterioration is less significant (1.542 and 1.239, respectively). There is a clear tradeoff between homogeneity, conformity, and minimum dose to organs at risk (OARs). For head-and-neck and pediatric brain tumor, the model that minimizes total dose to critical structures and optimizes conformity simultaneously offers a compromise among these factors, resulting in reduced critical structure dose with conformal and homogeneous plans. In the prostate case, the tumor is smaller than the two large nearby critical structures, and all models provide very homogeneous PTV dose distribution. However, minimizing dose to critical structures worsens conformity, as it spreads the radiation to the area surrounding the PTV. The maximum dose to the critical structures also increases slightly. Compared with plans used in the clinic which generally have uniformly spaced beam angles, the optimal clinically acceptable plans obtained via the methods herein do not have equispaced beams. The optimal beam angles returned appear to be nonintuitive, and depend on PTV size and geometry and the spatial relationship between the tumor and critical structures. CONCLUSIONS: The MIP model described allows simultaneous optimization over the space of beamlet fluence weights and beam and couch angles. Based on experiments with tumor data, this approach can return good plans that are clinically acceptable and practical. This work distinguishes itself from recent IMRT research in several ways. First, in previous methods beam angles are selected before intensity map optimization. Herein, we employ 0/1 variables to model the set of candidate beams, and thereby allow the optimization process itself to select optimal beams. Second, instead of incorporating dose-volume criteria within the objective function as in previous work, herein, a combination of discrete and continuous variables associated with each voxel provides a mechanism to strictly enforce dose-volume criteria within the constraints. Third, using the construct of critical-normal-tissue-ring within the objective function can enhance the achievement of conformal plans. Based on the three tumor sites considered, it appears that volume and spatial geometry with respect to the PTV are important factors to consider when selecting objectives to optimize, and in estimating how well suited a particular model is for achieving a specified goal.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eva K Lee, Tim Fox, Ian Crocker. 2005-11-14. Simultaneous beam geometry and intensity map optimization in intensity-modulated radiation therapy.. https://doi.org/10.1016/j.ijrobp.2005.08.023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗