PubMed Health⌕ Search

PubMed · 16696492

Robust frameless stereotactic localization in extra-cranial radiotherapy.

Abstract

In the field of extra-cranial radiotherapy, several inaccuracies can make the application of frameless stereotactic localization techniques error-prone. When optical tracking systems based on surface fiducials are used, inter- and intra-fractional uncertainties in marker three-dimensional (3D) detection may lead to inexact tumor position estimation, resulting in erroneous patient setup. This is due to the fact that external fiducials misdetection results in deformation effects that are poorly handled in a rigid-body approach. In this work, the performance of two frameless stereotactic localization algorithms for 3D tumor position reconstruction in extra-cranial radiotherapy has been specifically tested. Two strategies, unweighted versus weighted, for stereotactic tumor localization were examined by exploiting data coming from 46 patients treated for extra-cranial lesions. Measured isocenter displacements and rotations were combined to define isocentric procedures, featuring 6 degrees of freedom, for correcting patient alignment (isocentric positioning correction). The sensitivity of the algorithms to uncertainties in the 3D localization of fiducials was investigated by means of 184 numerical simulations. The performance of the implemented isocentric positioning correction was compared to conventional point-based registration. The isocentric positioning correction algorithm was tested on a clinical dataset of inter-fractional and intra-fractional setup errors, which was collected by means of an optical tracker on the same group of patients. The weighted strategy exhibited a lower sensitivity to fiducial localization errors in simulated misalignments than those of the unweighted strategy. Isocenter 3D displacements provided by the weighted strategy were consistently smaller than those featured by the unweighted strategy. The peak decrease in median and quartile values of isocenter 3D displacements were 1.4 and 2.7 mm, respectively. Concerning clinical data, the weighted strategy isocentric positioning correction provided the reduction of fiducial registration errors, featuring up to 61.7% decrease in median values (versus 46.8% for the unweighted strategy) of initial displacements. The weighted strategy proved high performance in minimizing the effects of fiducial localization errors, showing a great potential in improving patient setup. The clinical data analysis revealed that the application of a robust reconstruction algorithm may provide high-quality results in patient setup verification, by properly managing external fiducials localization errors.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Riboldi, Guido Baroni, Maria Francesca Spadea, Fabio Bassanini, Barbara Tagaste, Cristina Garibaldi, Roberto Orecchia, Antonio Pedotti. 2006. Robust frameless stereotactic localization in extra-cranial radiotherapy.. https://doi.org/10.1118/1.2181299

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↗