Advertisement

Topological Map Based Algorithms for 3D Image Segmentation

  • Guillaume Damiand
  • Patrick Resch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)

Abstract

One of the most commonly used approach to segment a 2D image is the split and merge approach. In this paper, we are defining these two operations in 3D within the topological maps framework. This mathematic model of regions segmented image representation allows us to define these algorithms in a local and generic way. Moreover, we are defining a new operation, the corefining, which allows to treat big images. They are cut into small units, treated separately, then the result of each of themare combined to reconstruct the final representation. These three operations let us view efficient 3D segmentation algorithms, which is a difficult problemdue to the size of data to treat.

Keywords

Boundary Face Virtual Edge Closed Face Merging Operation Adjacent Object 
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.

References

  1. [1]
    Y. Bertrand, G. Damiand, and C. Fiorio. Topological encoding of 3d segmented images. In Discrete Geometry for Computer Imagery, number 1953 in Lecture Notes in Computer Science, pages 311–324, Uppsala, Sweden, december 2000.CrossRefGoogle Scholar
  2. [2]
    Y. Bertrand, G. Damiand, and C. Fiorio. Topological map: Minimal encoding of 3d segmented images. In Workshop on Graph based representations, pages 64–73, Ischia, Italy, may 2001. IAPR-TC15.Google Scholar
  3. [3]
    J.-P. Braquelaire and L. Brun. Image segmentation with topological maps and inter-pixel representation. Journal of Visual Communication and Image Representation, 9(1):62–79, march 1998.CrossRefGoogle Scholar
  4. [4]
    J.-P. Braquelaire, P. Desbarats, and J.-P. Domenger. 3d split and merge with 3-maps. In Workshop on Graph based representations, pages 32–43, Ischia, Italy, may 2001. IAPR-TC15.Google Scholar
  5. [5]
    J.-P. Braquelaire, P. Desbarats, J.-P. Domenger, and C.A. Wüthrich. A topological structuring for aggregates of 3d discrete objects. In Workshop on Graph based representations, pages 193–202, Austria, may 1999. IAPR-TC15.Google Scholar
  6. [6]
    R. Brice and C.L. Fennema. Scene analysis using regions. Artificial intelligence, 1:205–226, 1970.CrossRefGoogle Scholar
  7. [7]
    L. Brun. Segmentation d’images couleur à base Topologique. Thèse de doctorat, Université Bordeaux I, décembre 1996.Google Scholar
  8. [8]
    L. Brun and J.-P. Domenger. A new split and merge algorithm with topological maps and inter-pixel boundaries. In The fifth International Conference in Central Europe on Computer Graphics and Visualization, february 1997.Google Scholar
  9. [9]
    R. Cori. Un code pour les graphes planaires et ses applications. In Astérisque, volume 27. Soc. Math. de France, Paris, France, 1975.Google Scholar
  10. [10]
    J.P. Domenger. Conception et implémentation du noyeau graphique d’un environnement 2D1/2 d’édition d’images discrètes. Thèse de doctorat, Université Bordeaux I, avril 1992.Google Scholar
  11. [11]
    C. Fiorio and J. Gustedt. Two linear time union-find strategies for image processing. Theoretical Computer Science, 154:165–181, 1996.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    S.L. Horowitz and T. Pavlidis. Picture segmentation by a directed split-andmerge procedure. In Proc. of the Second International Joint Conf. on Pattern Recognition, pages 424–433, 1974.Google Scholar
  13. [13]
    C.H. Lee. Recursive region splitting at hierarchical scope views. Computer Vision, Graphics, and Image Processing, 33:237–258, 1986.CrossRefGoogle Scholar
  14. [14]
    P. Lienhardt. Subdivision of n-dimensional spaces and n-dimensional generalized maps. In 5th Annual ACM Symposium on Computational Geometry, pages 228–236, Saarbrücken, Germany, 1989.Google Scholar
  15. [15]
    P. Lienhardt. Topological models for boundary representation: a comparison with n-dimensional generalized maps. Computer Aided Design, 23(1):59–82, 1991.zbMATHCrossRefGoogle Scholar
  16. [16]
    R. Ohlander, K. Price, and D.R. Reddy. Picture segmentation using a recursive region splitting method. Computer Graphics and Image Processing, 8:313–333, 1978.CrossRefGoogle Scholar
  17. [17]
    M. Pietikainen, A. Rosenfeld, and I. Walter. Split and link algorithms for image segmentation. Pattern Recognition, 15(4):287–298, 1982.CrossRefGoogle Scholar
  18. [18]
    P. Resch. Algorithmes pour la manipulation des cartes topologiques en 2 et 3 dimensions. Mémoire de dea, Université Montpellier II, june 2001.Google Scholar
  19. [19]
    P. Resch. Algorithmes pour la manipulation des cartes topologiques en 2 et 3 dimensions. Annexe technique, Université Montpellier II, june 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Guillaume Damiand
    • 1
  • Patrick Resch
    • 1
  1. 1.LIRMMMontpellier Cedex 5France

Personalised recommendations