Plane Embedding of Dually Contracted Graphs

  • Roland Glantz
  • Walter G. Kropatsch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1953)


The use of plane graphs for the description of image structure and shape representation poses two problems : (1) how to obtain the set of vertices, the set of edges and the incidence relation of the graph, and (2) how to embed the graph into the plane image. Initially, the image is represented by an embedded graph G in a straight forward manner, i.e. the edges of G represent the 4-connectivity of the pixels. Let \( \overline G \) denote a (planar) abstract dual of G. Dual graph contraction is used to reduce the pair (\( \left( {\overline G ,G} \right) \),G) to a pair (\( \left( {\overline H ,H} \right) \),H) of planar abstract duals. Dual graph contraction is unsymmetric due to an extra condition on the choice of the contraction kernels in G. This condition is shown to be necessary and sufficient for H to be embedded onto G. The embedding is applied to the description of image structure and to shape representation.


Plane Graph Image Structure Dual Graph Gray Level Image Shape Representation 
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.


  1. BK99.
    Mark J. Burge and Walter G. Kropatsch. A minimal line property preserving representation of line images. Computing, 62:355–368, 1999. 349zbMATHCrossRefGoogle Scholar
  2. CM91.
    Jean Marc Chassery and Annick Montanvert. Géometrie Discrète en Imagery. Hermes, Paris, 1991. 356Google Scholar
  3. Die97.
    Reinhard Diestel. Graph Theory. Springer, New York, 1997. 348, 350, 353Google Scholar
  4. Fra96.
    Jean Francon. On Recent Trends in Discrete Geometry in Computer Science. In Serge Miguet, Michel Montanvert Annick, and Stéphane Ubéda, editors, Discrete Geometry for Computer Imagery, DGCI’96, volume Vol. 1176 of Lecture Notes in Computer Science, pages 3–16, Lyon, France, 1996. Springer, Berlin Heidelberg, New York. 348Google Scholar
  5. GEK99.
    Roland Glantz, Roman Englert, and Walter G. Kropatsch. Dual image graph contractions invariant to monotonic transformations of image intensity. In Proc. of the 2nd IAPR Workshop on Graph-based Representation, 1999. 349, 352, 355, 357Google Scholar
  6. KD94.
    J. Koenderink and A. van Doorn. Image structure. In E. Paulus and F. Wahl, editors, Mustererkennung 1997, pages 401–408. Springer, 1994. 352Google Scholar
  7. KM95.
    Walter G. Kropatsch and Herwig Macho. Finding the structure of connected components using dual irregular pyramids. In Cinquième Colloque DGCI, pages 147–158. LLAIC1, Université d’Auvergne, ISBN 2-87663-040-0, September 1995. 349, 350Google Scholar
  8. Kro95.
    Walter G. Kropatsch. Building Irregular Pyramids by Dual Graph Contraction. IEE-Proc. Vision, Image and Signal Processing, 142(6):366–374, 1995. 350Google Scholar
  9. MN99.
    K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge, U. K., 1999. 355Google Scholar
  10. Ogn94.
    R. L. Ogniewicz. A Multiscale MATfrom Voronoi Diagrams: The Skeleton-Space and its Application to Shape Description and Decomposition. In Carlo Arcelli, Luigi P. Cordella, and Gabriella Sanniti di Baja, editors, 2nd Intl. Workshop on Visual Form, pages 430–439, Capri, Italy, June 1994. 356Google Scholar
  11. Ser82.
    Jean Serra. Image and Mathematical Morphology, volume 1. Academic Press, London, G. B., 1982. 356zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Roland Glantz
    • 1
  • Walter G. Kropatsch
    • 1
  1. 1.Pattern Recognition and Image Processing Group 183/2 Institute for Computer Aided AutomationVienna University of Technology FavoritenstrViennaAustria

Personalised recommendations