PubMed Health⌕ Search

PubMed · 12408304

Beyond bixels: generalizing the optimization parameters for intensity modulated radiation therapy.

Abstract

Intensity modulated radiation therapy (IMRT) treatment planning systems optimize fluence distributions by subdividing the fluence distribution into rectangular bixels. The algorithms typically optimize the fluence intensity directly, often leading to fluence distributions with sharp discontinuities. These discontinuities may yield difficulties in delivery of the fluence distribution, leading to inaccurate dose delivery. We have developed a method for decoupling the bixel intensities from the optimization parameters; either by introducing optimization control points from which the bixel intensities are interpolated or by parametrizing the fluence distribution using basis functions. In either case, the number of optimization search parameters is reduced from the direct bixel optimization method. To illustrate the concept, the technique is applied to two-dimensional idealized head and neck treatment plans. The interpolation algorithms investigated were nearest-neighbor, linear and cubic spline, and radial basis functions serve as the basis function test. The interpolation and basis function optimization techniques were compared against the direct bixel calculation. The number of optimization parameters were significantly reduced relative to the bixel optimization, and this was evident in the reduction of computation time of as much as 58% from the full bixel optimization. The dose distributions obtained using the reduced optimization parameter sets were very similar to the full bixel optimization when examined by dose distributions, statistics, and dose-volume histograms. To evaluate the sensitivity of the fluence calculations to spatial misalignment caused either by delivery errors or patient motion, the doses were recomputed with a 1 mm shift in each beam and compared to the unshifted distributions. Except for the nearest-neighbor algorithm, the reduced optimization parameter dose distributions were generally less sensitive to spatial shifts than the bixel optimization. These results indicate that significant reductions in optimization parameter sets can be accomplished with a negligible reduction in dose distribution quality. The decreased parameters can result in a reduced optimization time, or can be used to allow an improved and consequently more computation-intensive dose calculation for more accurate dose calculations during the optimization process. The basis functions may be generalized to model the accelerator motion for direct computation of the accelerator motion sequence, removing the need for developing an independent leaf sequence step.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jerry Markman, Daniel A Low, Andrew W Beavis, Joseph O Deasy. 2002. Beyond bixels: generalizing the optimization parameters for intensity modulated radiation therapy.. https://doi.org/10.1118/1.1508799

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↗