Inside and Outside Within Combinatorial Pyramids

  • Luc Brun
  • Walter Kropatsch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3434)


Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are often used within the segmentation and the connected component analysis frameworks to detect meaningful objects together with their spatial and topological relationships. The graphs reduced in the pyramid may be region adjacency graphs, dual graphs or combinatorial maps. Using any of these graphs each vertex of a reduced graph encodes a region of the image. Using simple graphs one edge between two vertices encodes the existence of a common boundary between two regions. Using dual graphs and combinatorial maps, each connected boundary segment between two regions is associated to one edge. Moreover, special edges called loops may be used to differentiate a special type of adjacency where one region surrounds the other. We show in this article that the loop information does not allow to distinguish inside and outside of the loop by local computations. We provide a method based on the combinatorial pyramid framework which uses the orientation explicitly encoded by combinatorial maps to determine inside and outside with local calculus.


Dual Graph Closed Boundary Double Edge Inclusion Relationship Adjacency Relationship 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Braquelaire, J.P., Domenger, J.P.: Geometrical, topological, and hierarchical structuring of overlapping 2-d discrete objects. Computers & Graphics 21(5), 587–597 (1997)CrossRefGoogle Scholar
  2. 2.
    Brun, L.: Traitement d’images couleur et pyramides combinatoires. Habilitation à diriger des recherches, Université de Reims (2002)Google Scholar
  3. 3.
    Brun, L., Kropatsch, W.: Combinatorial pyramids. In: Suvisoft (ed.) IEEE International conference on Image Processing (ICIP), Barcelona, September 2003, vol. II, pp. 33–37. IEEE, Los Alamitos (2003)Google Scholar
  4. 4.
    Brun, L., Kropatsch, W.: Receptive fields within the combinatorial pyramid framework. Graphical Models 65, 23–42 (2003)zbMATHCrossRefGoogle Scholar
  5. 5.
    Brun, L., Mokhtari, M., Meyer, F.: Hierarchical watersheds within the combinatorial pyramid framework. In: Andrès, É., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol. 3429, pp. 34–44. Springer, Heidelberg (2005), IAPR-TC18 (to be published)CrossRefGoogle Scholar
  6. 6.
    Kropatsch, W.G.: Building Irregular Pyramids by Dual Graph Contraction. IEE-Proc. Vision, Image and Signal Processing 142(6), 366–374 (1995)CrossRefGoogle Scholar
  7. 7.
    Meer, P.: Stochastic image pyramids. Computer Vision Graphics Image Processing 45, 269–294 (1989)CrossRefGoogle Scholar
  8. 8.
    Montanvert, A., Meer, P., Rosenfeld, A.: Hierarchical image analysis using irregular tessellations. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(4), 307–316 (1991)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Luc Brun
    • 1
  • Walter Kropatsch
    • 2
  1. 1.GreYC -CNRS UMR 6072, ENSICAENCaenFrance
  2. 2.Institute for Computer-aided Automation, Pattern Recognition and Image Processing GroupVienna Univ. of TechnologyAustria

Personalised recommendations