PubMed Health⌕ Search

PubMed · 15895570

Four-dimensional computed tomography: image formation and clinical protocol.

Abstract

Respiratory motion can introduce significant errors in radiotherapy. Conventional CT scans as commonly used for treatment planning can include severe motion artifacts that result from interplay effects between the advancing scan plane and object motion. To explicitly include organ/target motion in treatment planning and delivery, time-resolved CT data acquisition (4D Computed Tomography) is needed. 4DCT can be accomplished by oversampled CT data acquisition at each slice. During several CT tube rotations projection data are collected in axial cine mode for the duration of the patient's respiratory cycle (plus the time needed for a full CT gantry rotation). Multiple images are then reconstructed per slice that are evenly distributed over the acquisition time. Each of these images represents a different anatomical state during a respiratory cycle. After data acquisition at one couch position is completed, x rays are turned off and the couch advances to begin data acquisition again until full coverage of the scan length has been obtained. Concurrent to CT data acquisition the patient's abdominal surface motion is recorded in precise temporal correlation. To obtain CT volumes at different respiratory states, reconstructed images are sorted into different spatio-temporally coherent volumes based on respiratory phase as obtained from the patient's surface motion. During binning, phase tolerances are chosen to obtain complete volumetric information since images at different couch positions are reconstructed at different respiratory phases. We describe 4DCT image formation and associated experiments that characterize the properties of 4DCT. Residual motion artifacts remain due to partial projection effects. Temporal coherence within resorted 4DCT volumes is dominated by the number of reconstructed images per slice. The more images are reconstructed, the smaller phase tolerances can be for retrospective sorting. From phantom studies a precision of about 2.5 mm for quasiregular motion and typical respiratory periods could be concluded. A protocol for 4DCT scanning was evaluated and clinically implemented at the MGH. Patient data are presented to elucidate how additional patient specific parameters can impact 4DCT imaging.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eike Rietzel, Tinsu Pan, George T Y Chen. 2005. Four-dimensional computed tomography: image formation and clinical protocol.. https://doi.org/10.1118/1.1869852

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↗