PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 16696465

Bone-composition imaging using coherent-scatter computed tomography: assessing bone health beyond bone mineral density.

Deidre L Batchelar·Melanie T M Davidson·Waldemar Dabrowski·Ian A Cunningham
View original source ↗Export metadata ↓

Abstract

Quantitative analysis of bone composition is necessary for the accurate diagnosis and monitoring of metabolic bone diseases. Accurate assessment of the bone mineralization state is the first requirement for a comprehensive analysis. In diagnostic imaging, x-ray coherent scatter depends upon the molecular structure of tissues. Coherent-scatter computed tomography (CSCT) exploits this feature to identify tissue types in composite biological specimens. We have used CSCT to map the distributions of tissues relevant to bone disease (fat, soft tissue, collagen, and mineral) within bone-tissue phantoms and an excised cadaveric bone sample. Using a purpose-built scanner, we have measured hydroxyapatite (bone mineral) concentrations based on coherent-scatter patterns from a series of samples with varying hydroxyapatite content. The measured scatter intensity is proportional to mineral density in true g/cm3. Repeated measurements of the hydroxyapatite concentration in each sample were within, at most, 2% of each other, revealing an excellent precision in determining hydroxyapatite concentration. All measurements were also found to be accurate to within 3% of the known values. Phantoms simulating normal, over-, and under-mineralized bone were created by mixing known masses of pure collagen and hydroxyapatite. An analysis of the composite scatter patterns gave the density of each material. For each composite, the densities were within 2% of the known values. Collagen and hydroxyapatite concentrations were also examined in a bone-mimicking phantom, incorporating other bone constituents (fat, soft tissue). Tomographic maps of the coherent-scatter properties of each specimen were reconstructed, from which material-specific images were generated. Each tissue was clearly distinguished and the collagen-mineral ratio determined from this phantom was also within 2% of the known value. Existing bone analysis techniques cannot determine the collagen-mineral ratio in intact specimens. Finally, to demonstrate the in situ potential of this technique, the mineralization state of an excised normal cadaveric radius was examined. The average collagen-mineral ratio of the cortical bone derived from material-specific images of the radius was 0.53+/-0.04, which is in agreement with the expected value of 0.55 for healthy bones.

Explore related subjects

AlgorithmsBone DensityBone and BonesCadaverCalcification, PhysiologicHumansImage Interpretation, Computer-AssistedIn Vitro TechniquesLightModels, BiologicalPhantoms, ImagingScattering, RadiationJournal ArticleResearch Support, Non-U.S. Gov't

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Deidre L Batchelar, Melanie T M Davidson, Waldemar Dabrowski, Ian A Cunningham. 2006. Bone-composition imaging using coherent-scatter computed tomography: assessing bone health beyond bone mineral density.. https://doi.org/10.1118/1.2179151

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↗