Topological Operators on the Topological Graph of Frontiers

  • Ehoud Ahronovitz
  • Christophe Fiorio
  • Sylvain Glaize
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1568)

Abstract

The Topological Graph of Frontiers is in our opinion a good graph structure representing the topology of segmented images. In this paper we deal with topological operators which achieve directly on the graph current operations performed on segmented images.

Well known graph structures such as the Region Adjacency Graph [Pav77] [Ros74] do not (and cannot) keep track of the topology and so cannot maintain it. We claim that the structures and operators described here, on the contrary, allow and do this maintenance. One of the most important informations in such images is the inclusion of nested regions and one of the most important operators is the union of regions. We deal essentially with these in this paper. They are described in detail herein and we show how the topological coherence is maintained. This is why we entitle them topological operators. Other operators that we have already developed are briefly described.

Keywords

topological operator enclosed region topological graph of frontiers topological representation segmented image manipulation 

References

  1. AAF95.
    E. Ahronovitz, J.-P. Aubert, and C. Fiorio. The star-topology: a topology for image analysis. In 5 th Discrete Geometry for Computer Imagery, Proceedings, pages 107–116. Groupe GDR PRC/AMI du CNRS, september 1995.Google Scholar
  2. Edm60.
    J. Edmonds. A combinatorial representation for polyhedral surfaces. Notices of the American Mathematical Society, 7, 1960.Google Scholar
  3. Fio95.
    C. Fiorio. Approche interpixel en analyse d’images: une topologie et des algorithmes de segmentation. Thése de doctorat, Université Montpellier II, 24 novembre 1995.Google Scholar
  4. Fio96.
    C. Fiorio. A topologically consistent representation for image analysis: the frontiers topological graph. In S. Ubeda S. Miguet, A. Montanvert, editor, 6th International Workshop, DGCI’96, number 1176 in Lecture Notes in Computer Sciences, pages 151–162, Lyon, France, November 1996.Google Scholar
  5. Gla98.
    S. Glaize. Manipulations topologiques et opérations sur les graphes topologiques des frontières. Technical Report 98122, Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier, 161, rue Ada-F-34392 Montpellier Cedex 5, november 1998.Google Scholar
  6. KKM90.
    E. Khalimsky, R. Kopperman, and P.R. Meyer. Computer graphics and connected topologies on finite ordered sets. Topology and its Applications, 36:1–17, 1990.MATHCrossRefMathSciNetGoogle Scholar
  7. KM95.
    W. Kropatsch and H. Macho. Finding the structure of connected components using dual irregular pyramids. In 5 th Discrete Geometry for Computer Imagery, Proceedings, pages 147–158. Groupe GDR PRC/AMI du CNRS, september 1995.Google Scholar
  8. Kov89.
    V.A. Kovalevsky. Finite topology as applied to image analysis. 46:141–161, 1989.Google Scholar
  9. Lie89.
    P. Lienhardt. Subdivision of n-dimensional spaces and n-dimensional generalized maps. In 5 th Annual ACM Symposium on Computational Geometry, pages 228–236, Saarbrücken, Germany, 1989.Google Scholar
  10. Pav77.
    T. Pavlidis. Structural pattern recognition. Springer-Verlag, New-York, 1977.MATHGoogle Scholar
  11. Ros74.
    A. Rosenfeld. Adjacency in digital pictures. Inform. and control, 26:24–33, 1974.CrossRefMathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Ehoud Ahronovitz
    • 1
  • Christophe Fiorio
    • 1
  • Sylvain Glaize
    • 1
  1. 1.LIRMMMontpellier Cedex 5France

Personalised recommendations