Contains and inside relationships within combinatorial pyramids

  • Authors:
  • Luc Brun;Walter Kropatsch

  • Affiliations:
  • GreYC -CNRS UMR 6072, ENSICAEN, 6 Boulevard du Maréchal Juin, 14045 Caen, France;Institute for Computer-Aided Automation, Pattern Recognition and Image Processing Group, Vienna University of Technology, Austria

  • Venue:
  • Pattern Recognition
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

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.