Abstract

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.

Highlights

  • Lung cancer is one of the most lethal cancers in the world, and its 5-year-survival rate is only 18% [1]

  • Noninvasive imaging is often used in clinical practice, and computed tomography (CT) images have a crucial role in early lung cancer diagnosis and survival time improvement [2]

  • This study proposes an algorithm based on the fast marching method (FMM) that can accurately segment lung nodules in CT images, creating a powerful tool that can be employed in CADx systems

Read more

Summary

Introduction

Lung cancer is one of the most lethal cancers in the world, and its 5-year-survival rate is only 18% [1]. Computer-aided diagnosis (CADx) systems for automatic diagnosis of pulmonary diseases and lung cancer have been devised over the years to assist in this endeavor. Firstly the speed function is defined for every point in the spatial grid and a starting point is chosen, from which arrival times are calculated iteratively using the fact that information only flows outward. This problem is a special case of level set methods [51], namely, it is a more efficient and discrete application. While taking a two dimensional case with a front moving with speed

Methods
Results
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call