Integration of Morphology and Graph-based Techniques for Fully Automatic Liver Segmentation

Here a fully ۳D algorithm for automatic liver segmentation from CT volumetric datasets is presented. The algorithm starts by smoothing the original volume using anisotropic diffusion. The coarse liver region is obtained from the threshold process that is based on a priori knowledge. Then, several morphological operations is performed such as operating the liver to detach the unwanted region connected to the liver and finding the largest component using the connected component labeling (CCL) algorithm. At this stage, both ۳D and ۲D CCL is done subsequently. However, in ۲D CCL, the adjacent slices are also affected from current slice changes. Finally, the boundary of the liver is refined using graph-cuts solver.  Our algorithm does not require any user interaction or training datasets to be used. The algorithm has been evaluated on ۱۰ CT scans of the liver and the results are encouraging to poor quality of images.

Keywords:

computer science , Computed Tomography , en , image processing , ۳D Liver segmentation Graph-cuts , morphological operations