Contains and Inside relationships within combinatorial Pyramids

TL;DR

This paper compares various graph models in irregular pyramids for image segmentation and introduces a new local algorithm based on combinatorial maps to determine containment relationships between regions.

Contribution

It provides a comparative analysis of graph models in irregular pyramids and proposes a novel local algorithm for containment detection using combinatorial maps.

Findings

Different graph models encode various region relationships.

The new algorithm efficiently determines containment with local calculations.

The approach enhances hierarchical segmentation analysis.

Abstract

Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of partitions. The different graph models used within the irregular pyramid framework encode different types of relationships between regions. This paper compares different graph models used within the irregular pyramid framework according to a set of relationships between regions. We also define a new algorithm based on a pyramid of combinatorial maps which allows to determine if one region contains the other using only local calculus.