HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Region Merging Via Graph-Cuts

Abstract : In this paper, we discuss the use of graph-cuts to merge the re gions of the watershed transform optimally. Watershed is a simple, intuitive and efficient way of segmen ting an image. Unfortunately it presents a few limitations such as over-segmentation and poor detection o f low boundaries. Our segmentation process merges regions of the watershed over-segmentation by minimizing a specific criterion using graph-cuts optimization. Two methods will be introduced in this paper. The first is bas ed on regions histogram and dissimilarity measures between adjacent regions. The second method deals with efficient approximation of minimal surfaces and geodesics. Experimental results show that the se techniques can efficiently be used for large images segmentation when a pre-computed low level segmenta tion is available. We will present these methods in the context of interactive medical image segmentation.
Document type :
Journal articles
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

Contributor : Bibliothèque Mines Paristech Connect in order to contact the contributor
Submitted on : Thursday, June 6, 2013 - 8:47:32 AM
Last modification on : Wednesday, November 17, 2021 - 12:27:09 PM
Long-term archiving on: : Saturday, September 7, 2013 - 4:08:20 AM


Publisher files allowed on an open archive



Jean Stawiaski, Etienne Decencière. Region Merging Via Graph-Cuts. Image Analysis and Stereology, International Society for Stereology, 2008, 27 (1), pp.39-45. ⟨10.5566/ias.v27.p39-45⟩. ⟨hal-00830726⟩



Record views


Files downloads