Lung Nodule Segmentation with a Region-Based Fast Marching Method.

Sensors (Basel)

School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing 100044, China.

Published: March 2021

When dealing with computed tomography volume data, the accurate segmentation of lung nodules is of great importance to lung cancer analysis and diagnosis, being a vital part of computer-aided diagnosis systems. However, due to the variety of lung nodules and the similarity of visual characteristics for nodules and their surroundings, robust segmentation of nodules becomes a challenging problem. A segmentation algorithm based on the fast marching method is proposed that separates the image into regions with similar features, which are then merged by combining regions growing with k-means. An evaluation was performed with two distinct methods (objective and subjective) that were applied on two different datasets, containing simulation data generated for this study and real patient data, respectively. The objective experimental results show that the proposed technique can accurately segment nodules, especially in solid cases, given the mean Dice scores of 0.933 and 0.901 for round and irregular nodules. For non-solid and cavitary nodules the performance dropped-0.799 and 0.614 mean Dice scores, respectively. The proposed method was compared to active contour models and to two modern deep learning networks. It reached better overall accuracy than active contour models, having comparable results to DBResNet but lesser accuracy than 3D-UNet. The results show promise for the proposed method in computer-aided diagnosis applications.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7967233PMC
http://dx.doi.org/10.3390/s21051908DOI Listing

Publication Analysis

Top Keywords

fast marching
8
marching method
8
lung nodules
8
computer-aided diagnosis
8
dice scores
8
proposed method
8
active contour
8
contour models
8
nodules
7
lung
4

Similar Publications

This paper compares three automated path-planning algorithms based on publicly available data. The algorithms include a Dijkstra-based algorithm (DBA) that improves on the straightforward application of Dijkstra's algorithm, which restricts the path only to the grid edges. We present a fair and comprehensive comparison method for evaluating multiple algorithms-DBA, the Fast Marching Method (FMM), and a great circle-based method.

View Article and Find Full Text PDF

Efficient acceleration of the convergence of the minimum free energy path via a path-planning generated initial guess.

J Comput Chem

January 2025

Department of Chemistry, Chicago Center for Theoretical Chemistry, James Franck Institute, and Institute for Biophysical Dynamics, The University of Chicago, Chicago, Illinois, USA.

We demonstrate that combining a shifted clustering algorithm with a fast-marching-based algorithm can generate accurate approximations of the minimum energy path (MEP) given a free energy landscape (FEL). Using this approximation as the initial guess for the MEP, followed by further refinement with the string method (referred to as the fast marching tree (FMT)-string combined approach), significantly reduces the number of iterations required for MEP convergence. This approach saves substantial time compared to using linear interpolation (LI) for the initial guess.

View Article and Find Full Text PDF

Intraoperative imaging techniques for reconstructing deformable tissues in vivo are pivotal for advanced surgical systems. Existing methods either compromise on rendering quality or are excessively computationally intensive, often demanding dozens of hours to perform, which significantly hinders their practical application. In this paper, we introduce Fast Orthogonal Plane (Forplane), a novel, efficient framework based on neural radiance fields (NeRF) for the reconstruction of deformable tissues.

View Article and Find Full Text PDF

Determining individual glomerular proteinuria and periglomerular infiltration in a cleared murine kidney by a 3-dimensional fast marching algorithm.

Kidney Int

June 2024

Institute for Molecular Medicine and Experimental Immunology, University Hospital Bonn, Bonn, Germany; Department of Microbiology and Immunology, Doherty Institute for Infection and Immunity, University of Melbourne, Melbourne, Victoria, Australia. Electronic address:

Three-dimensional (3D) imaging has advanced basic research and clinical medicine. However, limited resolution and imperfections of real-world 3D image material often preclude algorithmic image analysis. Here, we present a methodologic framework for such imaging and analysis for functional and spatial relations in experimental nephritis.

View Article and Find Full Text PDF

Analyses of biomedical images often rely on accurate segmentation of structures of interest. Traditional segmentation methods based on thresholding, watershed, fast marching, and level set perform well in high-contrast images containing structures of similar intensities. However, such methods can under-segment or miss entirely low-intensity objects on noisy backgrounds.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!