By Topic

A Novel Post-Process Approach for Fast Marching Method in Liver CT Slices Automatic Segmentation

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
$33 $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)
Shaohui Huang ; Comput. Sci. Dept., Xiamen Univ., Xiamen, China ; Boliang Wang ; Xiaoli Hou ; Xiaoping Min

Liver segmentation on computed tomography (CT) slices is a challenging task because the images are often corrupted by noise and sampling artifacts. Recent years fast marching method (FMM) has been introduced into the image segmentation domain and proved to have advantage in blur edge detection. When apply the FMM to the segmentation of liver CT slice, to attain the completely liver shape, an over-segmentation result was usually unavoidable due to the poor contrast between the liver matter and the surrounding tissues. Therefore, in this paper, based on the FMM, a novel post-process approach is proposed. This approach mainly depends on the curve-fitting algorithm and takes into account the liver shape continuity and comparability. Followed with this post-processing, our algorithm can segment the liver CT slices correctly and quickly. First, a speed image can be generated after pretreatment such as filtering and noise reduction. Second, according to the characteristics of liver CT slices, the FMM parameters are attained from contiguous slice to continue the segmentation procedure. Finally, liver boundary is corrected by our approach. The whole procedure is nearly complete automatization, only a seed point is needed at the beginning.

Published in:

Computer Science and Information Engineering, 2009 WRI World Congress on  (Volume:1 )

Date of Conference:

March 31 2009-April 2 2009