PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 12128137

Flat-panel cone-beam computed tomography for image-guided radiation therapy.

David A Jaffray·Jeffrey H Siewerdsen·John W Wong·Alvaro A Martinez
View original source ↗Export metadata ↓

Abstract

PURPOSE: Geometric uncertainties in the process of radiation planning and delivery constrain dose escalation and induce normal tissue complications. An imaging system has been developed to generate high-resolution, soft-tissue images of the patient at the time of treatment for the purpose of guiding therapy and reducing such uncertainties. The performance of the imaging system is evaluated and the application to image-guided radiation therapy is discussed. METHODS AND MATERIALS: A kilovoltage imaging system capable of radiography, fluoroscopy, and cone-beam computed tomography (CT) has been integrated with a medical linear accelerator. Kilovoltage X-rays are generated by a conventional X-ray tube mounted on a retractable arm at 90 degrees to the treatment source. A 41 x 41 cm(2) flat-panel X-ray detector is mounted opposite the kV tube. The entire imaging system operates under computer control, with a single application providing calibration, image acquisition, processing, and cone-beam CT reconstruction. Cone-beam CT imaging involves acquiring multiple kV radiographs as the gantry rotates through 360 degrees of rotation. A filtered back-projection algorithm is employed to reconstruct the volumetric images. Geometric nonidealities in the rotation of the gantry system are measured and corrected during reconstruction. Qualitative evaluation of imaging performance is performed using an anthropomorphic head phantom and a coronal contrast phantom. The influence of geometric nonidealities is examined. RESULTS: Images of the head phantom were acquired and illustrate the submillimeter spatial resolution that is achieved with the cone-beam approach. High-resolution sagittal and coronal views demonstrate nearly isotropic spatial resolution. Flex corrections on the order of 0.2 cm were required to compensate gravity-induced flex in the support arms of the source and detector, as well as slight axial movements of the entire gantry structure. Images reconstructed without flex correction suffered from loss of detail, misregistration, and streak artifacts. Reconstructions of the contrast phantom demonstrate the soft-tissue imaging capability of the system. A contrast of 47 Hounsfield units was easily detected in a 0.1-cm-thick reconstruction for an imaging exposure of 1.2 R (in-air, in absence of phantom). The comparison with a conventional CT scan of the phantom further demonstrates the spatial resolution advantages of the cone-beam CT approach. CONCLUSIONS: A kV cone-beam CT imaging system based on a large-area, flat-panel detector has been successfully adapted to a medical linear accelerator. The system is capable of producing images of soft tissue with excellent spatial resolution at acceptable imaging doses. Integration of this technology with the medical accelerator will result in an ideal platform for high-precision, image-guided radiation therapy.

Explore related subjects

AlgorithmsBrain NeoplasmsEquipment DesignHead and Neck NeoplasmsHumansPhantoms, ImagingRadiotherapy Planning, Computer-AssistedTomography, X-Ray ComputedJournal ArticleResearch Support, U.S. Gov't, Non-P.H.S.Research Support, U.S. Gov't, P.H.S.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David A Jaffray, Jeffrey H Siewerdsen, John W Wong, Alvaro A Martinez. 2002-08-01. Flat-panel cone-beam computed tomography for image-guided radiation therapy.. https://doi.org/10.1016/s0360-3016(02)02884-5

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↗