PubMed Health⌕ Search

PubMed · 15355559

An improved segmentation method for in vivo microCT imaging.

Abstract

UNLABELLED: Image segmentation methods for microCT can influence the accuracy of bone morphometry calculations. A new automated segmentation method is introduced, and its performance is compared with standard segmentation methods. The new method can improve the results of in vivo microCT, where the need to keep radiation dose low limits scan quality. INTRODUCTION: An important topic for microCT analysis of bone samples is the segmentation of the original reconstructed grayscale data sets to separate bone from non-bone. Problems like noise, resolution limitations, and beam-hardening make this a nontrivial issue. Inappropriate segmentation methods will reduce the potential power of microCT and may introduce bias in the architectural measurements, in particular, when new in vivo microCT with its inherent limitations in scan quality is used. Here we introduce a new segmentation method using local thresholds and compare its performance to standard global segmentation methods. MATERIAL AND METHODS: The local threshold method was validated by comparing the result of the segmentation with histology. Furthermore, the effect of choosing this new method versus standard segmentation methods using global threshold values was investigated by studying the sensitivity of these methods to signal to noise ratio and resolution. RESULTS: Using the new method on high-quality scans yielded accurate results and virtually no differences between histology and the segmented data sets could be observed. When prior knowledge about the volume fraction of the bone was available the global threshold also resulted in appropriate results. Degrading the scan quality had only minor effects on the performance of the new segmentation method. Although global segmentation methods were not sensitive to noise, it was not possible to segment both lower mineralized thin trabeculae and the higher mineralized cortex correctly with the same threshold value. CONCLUSION: At high resolutions, both the new local and conventional global segmentation methods gave near exact representations of the bone structure. When scanned samples are not homogenous (e.g., thick cortices and thin trabeculae) and when resolution is relatively low, the local segmentation method outperforms global methods. It maximizes the potential of in vivo microCT by giving good structural representation without the need to use longer scanning times that would increase absorption of harmful X-ray radiation by the living tissue.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan H Waarsing, Judd S Day, Harrie Weinans. 2004-07-12. An improved segmentation method for in vivo microCT imaging.. https://doi.org/10.1359/jbmr.040705

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↗