Segmentation Graph Hierarchies [chapter]

Yll Haxhimusa, Walter Kropatsch
2004 Lecture Notes in Computer Science  
The region's internal properties (color, texture, ...) help to identify them and their external relations (adjacency, inclusion, ...) are used to build groups of regions having a particular consistent meaning in a more abstract context. Low-level cue image segmentation in a bottom-up way, cannot and should not produce a complete final "good" segmentation. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. The aim of
more » ... this paper is to build a minimum weight spanning tree (M ST ) of an image in order to find region borders quickly in a bottom-up 'stimulus-driven' way based on local differences in a specific feature.
doi:10.1007/978-3-540-27868-9_36 fatcat:bg662gsk7vdrhmcntalq2q6vw4