Matching hierarchies of segmentation
Roland Glantz, Marcello Pelillo, Walter G. Kropatsch · 2002
We propose to match two hierarchies of segmentations by many-to-many mappings between the regions of the two hierarchies. The mappings preserve the order of the regions (w.r.t. set inclusion) in both hierarchies. The matching involves weights for the significance of individual regions within a hierarchy and similarity measures for the comparison of regions from different hierarchies. Irregular pyramids, in which each level consists of an attributed plane graph and an attributed dual graph are well suited to represent the hierarchies and to provide the information for computing the weights and the similarity measures. keywords: many-to-many matching, segmentation, pyramid, graphs. This work is supported by the Austrian Science Foundation (FWF) under grant P14445-MAT and by MURST under grant MM09308497.