PubMed Health⌕ Search

PubMed · 16193773

Computer-aided detection of lung nodules: false positive reduction using a 3D gradient field method and 3D ellipsoid fitting.

Abstract

We are developing a computer-aided detection system to assist radiologists in the detection of lung nodules on thoracic computed tomography (CT) images. The purpose of this study was to improve the false-positive (FP) reduction stage of our algorithm by developing features that extract three-dimensional (3D) shape information from volumes of interest identified in the prescreening stage. We formulated 3D gradient field descriptors, and derived 19 gradient field features from their statistics. Six ellipsoid features were obtained by computing the lengths and the length ratios of the principal axes of an ellipsoid fitted to a segmented object. Both the gradient field features and the ellipsoid features were designed to distinguish spherical objects such as lung nodules from elongated objects such as vessels. The FP reduction performance in this new 25-dimensional feature space was compared to the performance in a 19-dimensional space that consisted of features extracted using previously developed methods. The performance in the 44-dimensional combined feature space was also evaluated. Linear discriminant analysis with stepwise feature selection was used for classification. The parameters used for feature selection were optimized using the simplex algorithm. Training and testing were performed using a leave-one-patient-out scheme. The FP reduction performances in different feature spaces were evaluated by using the area Az under the receiver operating characteristic curve and the number of FPs per CT section at a given sensitivity as accuracy measures. Our data set consisted of 82 CT scans (3551 axial sections) from 56 patients with section thickness ranging from 1.0 to 2.5 mm. Our prescreening algorithm detected 111 of the 116 solid nodules (nodule size: 3.0-30.6 mm) marked by experienced thoracic radiologists. The test Az values were 0.95 +/- 0.01, 0.88 +/- 0.02, and 0.94 +/- 0.01 in the new, previous, and combined feature spaces, respectively. The number of FPs per section at 80% sensitivity in these three feature spaces were 0.37, 1.61, and 0.34, respectively. The improvement in the test Az with the 25 new features was statistically significant (p<0.0001) compared to that with the previous 19 features alone.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhanyu Ge, Berkman Sahiner, Heang-Ping Chan, Lubomir M Hadjiiski, Philip N Cascade, Naama Bogot, Ella A Kazerooni, Jun Wei, Chuan Zhou. 2005. Computer-aided detection of lung nodules: false positive reduction using a 3D gradient field method and 3D ellipsoid fitting.. https://doi.org/10.1118/1.1944667

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&#xd7; to 17.6&#xd7; faster than POASTA, and 7.3&#xd7; 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&#xd7; to 16.9&#xd7; speedup on short reads. Moreover, Theseus is 1.5&#xd7; to 36.3&#xd7; 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↗