… When matching regions from two segmentation hierarchies we require that the topological
relations of the mapped regions are preserved. In other words, we are looking for consistent …

… partial matching results are fed back to the segmentation and … We consider regions as the
primitives to be matched, since … We present here the creation of the segmentation hierarchies…

… information from the hierarchical memory, we design two types of memory matching modules
based on the feature map’s scale: kernel guided dense memory matching at the coarsest …

… for matching. The motivation behind the work reported in this paper is to extend the matching
criteria to include hierarchical … Then, given two segmentation hierarchies, their matching is …

… approach for matching shapes based on a hierarchical description of … two shapes and for
matching a deformable shape model to a … to matching pre-segmented shapes. Instead, we can …

… Finally, using the correspondence we found, we refine the global 2D alignment by minimizing
the sum of residual distances between matched segments endpoints. The procedure …

… Instead, we propose to find the partition in the tree that best matches the ground-truth
partition, that is, the upper-bound partition selection. We show that different partition selection …

… be used to come up sequentially with hierarchical partitions.… use of segmented images, were
such segmentation rely on … make use of segmentation results in the problem of matching. It …

… the outlines of common tools are matched to gray-level … matched to lake edges from a map,
with translation, rotation, scale, and perspective changes. The hierarchical chamfer matching …

… The hierarchical segmentation presented in this paper is fast (see Table 1), robust to noise,
and suitable for producing useful segmentations of irregularly sampled models (Fig. 9). Due …