36 KB281 KB25 KB200020242008Decenciére, EtienneStawiaski, Jeanštevilka:1letnik:277 stranistr. 39-45ISSN:1580-3139COBISSID:24113113URN:URN:NBN:SI:doc-QIN232PNenDruštvo za stereologijo in kvantitativno analizo slike, Medicinska fakultetaImage analysis and stereologyData Interpretation, StatisticalGeografijaGeographygrafikagraphicsImage Processing, Computer-AssistedPodatki, interpretacija statističnarazvodjaSlika, obdelava z računalnikomstereologijaRegion merging via graph-cuts|In this paper, we discuss the use of graph-cuts to merge the regions of the watershed transform optimally. Watershed is a simple, intuitive and efficient way of segmenting an image. Unfortunately it presents a few limitations such as over-segmentation and poor detection of 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 based 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 these techniques can efficiently be used for large images segmentation when a pre-computed low level segmentation is available. We will present these methods in the context of interactive medical image segmentationTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaDruštvo za stereologijo in kvantitativno analizo slike