PubMed Health⌕ Search

PubMed · 15645334

Automatic colon segmentation with dual scan CT colonography.

Abstract

We present a fully automated three-dimensional (3-D) segmentation algorithm to extract the colon lumen surface in CT colonography. Focusing on significant-size polyp detection, we target at an efficient algorithm that maximizes overall colon coverage, minimizes the extracolonic components, maintains local shape accuracy, and achieves high segmentation speed. Two-dimensional (2-D) image processing techniques are employed first, resulting in automatic seed placement and better colon coverage. This is followed by near-air threshold 3-D region-growing using an improved marching-cubes algorithm, which provides fast and accurate surface generation. The algorithm constructs a well-organized vertex-triangle structure that uniquely employs a hash table method, yielding an order of magnitude speed improvement. We segment two scans, prone and supine, independently and with the goal of improved colon coverage. Both segmentations would be available for subsequent polyp detection systems. Segmenting and analyzing both scans improves surface coverage by at least 6% over supine or prone alone. According to subjective evaluation, the average coverage is about 87.5% of the entire colon. Employing near-air threshold and elongation criteria, only 6% of the data sets include extracolonic components (EC) in the segmentation. The observed surface shape accuracy of the segmentation is adequate for significant-size (6 mm) polyp detection, which is also verified by the results of the prototype detection algorithm. The segmentation takes less than 5 minutes on an AMD 1-GHz single-processor PC, which includes reading the volume data and writing the surface results. The surface-based segmentation algorithm is practical for subsequent polyp detection algorithms in that it produces high coverage, has a low EC rate, maintains local shape accuracy, and has a computational efficiency that makes real-time polyp detection possible. A fully automatic or computer-aided polyp detection system using this technique is likely to benefit future colon cancer early screening.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hong Li, Peter Santago. 2005. Automatic colon segmentation with dual scan CT colonography.. https://doi.org/10.1007/s10278-004-1032-4

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↗