Fully Automatic Segmentations of Liver and Hepatic Tumors From 3-D Computed Tomography Abdominal Images: Comparative Evaluation of Two Automatic Methods

• Published in: IEEE sensors journal Vol. 12; no. 3; pp. 464 - 473
• Main Authors: Casciaro, S., Franchini, R., Massoptier, L., Casciaro, E., Conversano, F., Malvasi, A., Lay-Ekuakille, A.
• Format: Journal Article
• Language: English
• Published: IEEE 01-03-2012
• Subjects: Accuracy; Active contours; Automatic segmentation; Computed tomography; gradient vector flow (GVF) active contours; graph-cuts; hepatic tumors and liver; Image segmentation; Liver; Manuals; Tumors
• ISSN: 1530-437X; 1558-1748
• DOI: 10.1109/JSEN.2011.2108281

An adaptive initialization method was developed to produce fully automatic processing frameworks based on graph-cut and gradient flow active contour algorithms. This method was applied to abdominal Computed Tomography (CT) images for segmentation of liver tissue and hepatic tumors. Twenty-five anonymized datasets were randomly collected from several radiology centres without specific request on acquisition parameter settings nor patient clinical situation as inclusion criteria. Resulting automatic segmentations of liver tissue and tumors were compared to their reference standard delineations manually performed by a specialist. Segmentation accuracy has been assessed through the following evaluation framework: dice similarity coefficient (DSC), false negative ratio (FNR), false positive ratio (FPR) and processing time. Regarding liver surfaces, graph-cuts achieved a DSC of 95.49% ( FPR=2.35% and FNR=5.10%), while active contours reached a DSC of 96.17% (FPR=3.35% and FNR=3.87%). The analyzed datasets presented 52 tumors: graph-cut algorithm detected 48 tumors with a DSC of 88.65%, while active contour algorithm detected only 44 tumors with a DSC of 87.10%. In addition, in terms of time performances, less time was requested for graph-cut algorithm with respect to active contour one. The implemented initialization method allows fully automatic segmentation leading to superior overall performances of graph-cut algorithm in terms of accuracy and processing time. The initialization method here presented resulted suitable and reliable for two different segmentation techniques and could be further extended.