Skip Navigation Linksdomov > napredno iskanje > rezultati > izpis
Zapis SUTRS

VRSTA GRADIVAanalitična raven (sestavni del), tekstovno gradivo, tiskano, 1.01 - izvirni znanstveni članek
DRŽAVA IZIDASlovenija
LETO IZIDA2008
JEZIK BESEDILA/IZVIRNIKAangleški
PISAVAlatinica
AVTORStawiaski, Jean - avtor
ODGOVORNOSTDecenciére, Etienne - avtor
NASLOVRegion merging via graph-cuts
V PUBLIKACIJIImage analysis & stereology. - ISSN 1580-3139. - ǂVol. ǂ27, ǂno. ǂ1 (mar. 2008), str. 39-45.
KRATKA VSEBINAIn 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 usinggraph-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 segmentation.
OPOMBEBibliografija: str. 45 // Abstract
PREDMETNE OZNAKE// Image Processing, Computer-Assisted // Geography // Data Interpretation, Statistical // Geografija // Podatki, interpretacija statistična // Slika, obdelava z računalnikom
PREDMETNE OZNAKE// grafika // razvodja // stereologija
UDK51-7, 004.93

izvedba, lastnina in pravice: NUK 2010