By Topic

Colonic polyp segmentation in CT colonography-based on fuzzy clustering and deformable models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jianhua Yao ; Diagnostic Radiol. Dept., Nat. Inst.s of Health, Bethesda, MD, USA ; Miller, M. ; Franaszek, M. ; Summers, R.M.

An automatic method to segment colonic polyps in computed tomography (CT) colonography is presented in this paper. The method is based on a combination of knowledge-guided intensity adjustment, fuzzy c-mean clustering, and deformable models. The computer segmentations were compared with manual segmentations to validate the accuracy of our method. An average 76.3% volume overlap percentage among 105 polyp detections was reported in the validation, which was very good considering the small polyp size. Several experiments were performed to investigate the intraoperator and interoperator repeatability of manual colonic polyp segmentation. The investigation demonstrated that the computer-human repeatability was as good as the interoperator repeatability. The polyp segmentation was also applied in computer-aided detection (CAD) to reduce the number of false positive (FP) detections and provide volumetric features for polyp classification. Our segmentation method was able to eliminate 30% of FP detections. The volumetric features computed from the segmentation can further reduce FP detections by 50% at 80% sensitivity.

Published in:

Medical Imaging, IEEE Transactions on  (Volume:23 ,  Issue: 11 )