Abstract
Background: Lung cancer is a greatest threat to people's health and life. CT image leads to unclear boundary segmentation. Segmentation of irregular nodules and complex structure, boundary information is not well considered and lung nodules have always been a hot topic. Objective: In this study, the pulmonary nodule segmentation is accomplished with the new graph cut algorithm. The problem of segmenting the juxta-pleural and juxta-vascular nodules was investigated which is based on graph cut algorithm. Methods: Firstly, the inflection points by the curvature was decided. Secondly, we used kernel graph cut to segment the nodules for the initial edge. Thirdly, the seeds points based on cast raying method is performed; lastly, a novel geodesic distance function is proposed to improve the graph cut algorithm and applied in lung nodules segmentation. Results: The new algorithm has been tested on total 258 nodules. Table 1 summarizes the morphologic features of all the nodules and given the results between the successful segmentation group and the poor/failed segmentation group. Figure 1 to Fig. (12) shows segmentation effect of Juxta-vascular nodules, Juxta-pleural nodules, and comparted with the other interactive segmentation methods. Conclusion: The experimental verification shows better results with our algorithm, the results will measure the volume numerical approach to nodule volume. The results of lung nodules segmentation in this study are as good as the results obtained by the other methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.