The MIDAS Journal logo

The MIDAS Journal

Home

Interactive Liver Tumor Segmentation Using Graph-cuts and Watershed

stawiaski, Jean, Decenciere, Etienne, Bidault, Francois
Centre de Morphologie Mathématique
The MIDAS Journal logo

Please use this identifier to cite or link to this publication: http://hdl.handle.net/10380/1416
New: Prefer using the following doi: https://doi.org/10.54294/5clvrb
Published in The MIDAS Journal - MICCAI 2008 Workshop: Grand Challenge Liver Tumor Segmentation.
Submitted by Jean Stawiaski on 2008-07-01T00:00:00Z.

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 adjacency 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 that we use 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 workshop called: "3D segmentation in the clinic : A Grand Challenge II".