PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 8873035

Modeling dose distributions from portal dose images using the convolution/superposition method.

T R McNutt·T R Mackie·P Reckwerdt·B R Paliwal
View original source ↗Export metadata ↓

Abstract

Post-treatment dose verification refers to the process of reconstructing delivered dose distributions internal to a patient from information obtained during the treatment. The exit dose is commonly used to describe the dose beyond the exit surface of the patient from a megavoltage photon beam. Portal imaging provides a method of determining the dose in a plane distal to a patient from a megavoltage therapeutic beam. This exit dose enables reconstruction of the dose distribution from external beam radiation throughout the patient utilizing the convolution/superposition method and an extended phantom. An iterative convolution/superposition algorithm has been created to reconstruct dose distributions in patients from exit dose measurements during a radiotherapy treatment. The method is based on an extended phantom that includes the patient CT representation and an electronic portal imaging device (EPID). The convolution/superposition method computes the dose throughout the extended phantom, which allows the portal dose image to be predicted in the EPID. The process is then reversed to take the portal dose measurement and infer what the dose distribution must have been to produce the measured portal dose. The dose distribution is modeled without knowledge of the incident intensity distribution, and includes the effects of scatter in the computation. The iterative method begins by assuming that the primary energy fluence (PEF) at the portal image plane is equal to the portal dose image, the PEF is then back-projected through the extended phantom and convolved with the dose deposition kernel to determine a new prediction of the portal dose image. The image of the ratio of the computed PEF to the computed portal dose is then multiplied by the measured portal dose image to produce a better representation of the PEF. Successive iterations of this process then converge to the exiting PEF image that would produce the measured portal dose image. Once convergence is established, the dose distribution is determined by back-projecting the PEF and convolving with the dose deposition kernel. The method is accurate, provided the patient representation during treatment is known. The method was used on three phantoms with a photon energy of 6 MV to verify convergence and accuracy of the algorithm. The reconstructed dose volumes agree to within 3% of the forward computation dose volumes. Furthermore, this technique assumes no prior knowledge of the incident fluence and therefore may better represent the dose actually delivered.

Explore related subjects

AlgorithmsHumansMonitoring, PhysiologicMonte Carlo MethodPhantoms, ImagingPhotonsRadiotherapyRadiotherapy DosageRadiotherapy Planning, Computer-AssistedTomography, X-Ray ComputedJournal ArticleResearch Support, Non-U.S. Gov'tResearch Support, U.S. Gov't, P.H.S.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

T R McNutt, T R Mackie, P Reckwerdt, B R Paliwal. 1996. Modeling dose distributions from portal dose images using the convolution/superposition method.. https://doi.org/10.1118/1.597872

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

KEEP EXPLORING

Related citations

PubMed2026

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↗
PubMed2026

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↗
PubMed2026

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↗