Liver segmentation approach using graph cuts and iteratively estimated shape and intensity constrains

40Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present a liver segmentation approach. In which, the relation between neighboring slices in CT images is utilized to estimate shape and statistical information of the liver. This information is then integrated with the graph cuts algorithm to segment the liver in each CT slice. This approach does not require prior models construction, and it uses single phase CT images; even so, it is talented to deal with complex shape and intensity variations. Moreover, it eliminates the burdens associated with model construction like data collection, manual segmentation, registration, and landmark correspondence. In contrast, it requires a low user interaction to determine the liver landmarks on a single CT slice only. The proposed approach has been evaluated on 10 CT images with several liver abnormalities, including tumors and cysts, and it achieved high average scores of 81.7 using MICCAI-2007 Grand Challenge scoring system. Compared to contemporary approaches, our approach requires significantly less interaction and processing time.

Cite

CITATION STYLE

APA

Afifi, A., & Nakaguchi, T. (2012). Liver segmentation approach using graph cuts and iteratively estimated shape and intensity constrains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7511 LNCS, pp. 395–403). Springer Verlag. https://doi.org/10.1007/978-3-642-33418-4_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free