Interactive Liver Tumor Segmentation Using Graph-cuts and Watershed - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Interactive Liver Tumor Segmentation Using Graph-cuts and Watershed

(1) , (1) , (2)


We present in this paper an application of minimal surfaces and Markov random fields to the segmentation of liver tumors. The originality of the work consists in applying these models to the region adja-cency graph of a watershed transform. We detail the assumptions and the approximations introduced in these models by using a region graph instead of a pixel graph. This strategy leads to an interactive method used to delineate tumors in 3D CT images. We detail our strategy to achieve relevant segmentations of these structures and compare our results to hand made segmentations done by experienced radiologists. This paper summarizes our participation to the MICCAI 2008 3 workshop called: " 3D segmentation in the clinic : A Grand Challenge II " .
Fichier principal
Vignette du fichier (1.8 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01445751 , version 1 (25-01-2017)


  • HAL Id : hal-01445751 , version 1


Jean Stawiaski, Etienne Decencière, François Bidault. Interactive Liver Tumor Segmentation Using Graph-cuts and Watershed. 11th International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI 2008), Sep 2008, New York, NY, United States. ⟨hal-01445751⟩
382 Consultations
650 Téléchargements


Gmail Facebook Twitter LinkedIn More