PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 16872094

A prototype table-top inverse-geometry volumetric CT system.

Taly Gilat Schmidt·Josh Star-Lack·N Robert Bennett·Samuel R Mazin·Edward G Solomon·Rebecca Fahrig·Norbert J Pelc
View original source ↗Export metadata ↓

Abstract

A table-top volumetric CT system has been implemented that is able to image a 5-cm-thick volume in one circular scan with no cone-beam artifacts. The prototype inverse-geometry CT (IGCT) scanner consists of a large-area, scanned x-ray source and a detector array that is smaller in the transverse direction. The IGCT geometry provides sufficient volumetric sampling because the source and detector have the same axial, or slice direction, extent. This paper describes the implementation of the table-top IGCT scanner, which is based on the NexRay Scanning-Beam Digital X-ray system (NexRay, Inc., Los Gatos, CA) and an investigation of the system performance. The alignment and flat-field calibration procedures are described, along with a summary of the reconstruction algorithm. The resolution and noise performance of the prototype IGCT system are studied through experiments and further supported by analytical predictions and simulations. To study the presence of cone-beam artifacts, a "Defrise" phantom was scanned on both the prototype IGCT scanner and a micro CT system with a +/-5 cone angle for a 4.5-cm volume thickness. Images of inner ear specimens are presented and compared to those from clinical CT systems. Results showed that the prototype IGCT system has a 0.25-mm isotropic resolution and that noise comparable to that from a clinical scanner with equivalent spatial resolution is achievable. The measured MTF and noise values agreed reasonably well with theoretical predictions and computer simulations. The IGCT system was able to faithfully reconstruct the laminated pattern of the Defrise phantom while the micro CT system suffered severe cone-beam artifacts for the same object. The inner ear acquisition verified that the IGCT system can image a complex anatomical object, and the resulting images exhibited more high-resolution details than the clinical CT acquisition. Overall, the successful implementation of the prototype system supports the IGCT concept for single-rotation volumetric scanning free from cone-beam artifacts.

Explore related subjects

AlgorithmsArtifactsCalibrationHumansImage Interpretation, Computer-AssistedPhantoms, ImagingTomography Scanners, X-Ray ComputedJournal ArticleResearch Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taly Gilat Schmidt, Josh Star-Lack, N Robert Bennett, Samuel R Mazin, Edward G Solomon, Rebecca Fahrig, Norbert J Pelc. 2006. A prototype table-top inverse-geometry volumetric CT system.. https://doi.org/10.1118/1.2192887

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↗