Share Email Print

Proceedings Paper

Grouping and segmentation in a hierarchy of graphs
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We review multilevel hierarchies under the special aspect of their potential for segmentation and grouping. The one-to-one correspondence between salient image features and salient model features are a limiting assumption that makes prototypical or generic object recognition impossible. The region's internal properties (color, texture, shape, ...) help to identify them and their external relations (adjacency, inclusion, similarity of properties) 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. This function measures the difference along the boundary of two components relative to a measure of differences of the components' internal differences. Two components are merged if there is a low-cost connection between them. We use this idea to find region borders quickly and effortlessly in a bottom-up way, based on local differences in a specific feature. The aim of this paper is to build a minimum weight spanning tree (MST) in order to find region borders quickly in a bottom-up 'stimulus-driven' way based on local differences in a specific feature.

Paper Details

Date Published: 21 May 2004
PDF: 12 pages
Proc. SPIE 5299, Computational Imaging II, (21 May 2004); doi: 10.1117/12.543421
Show Author Affiliations
Walter G. Kropatsch, Vienna Univ. of Technology (Austria)
Yll Haxhimusa, Vienna Univ. of Technology (Austria)

Published in SPIE Proceedings Vol. 5299:
Computational Imaging II
Charles A. Bouman; Eric L. Miller, Editor(s)

© SPIE. Terms of Use
Back to Top