Advertisement

A 3D-hole closing algorithm

  • Zouina Aktouf
  • Gilles Bertrand
  • Laurent Perroton
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1176)

Abstract

Contrary to the 2D case, a 3D hole is not a subset of the 3D space. It is therefore not possible to use connected component search algorithms for detecting and suppressing 3D holes.

In this paper, we propose an algorithm for closing 3D holes. It is based on properties of the previously introduced notion of topological numbers. Our algorithm is linear in time and it allows to control the size of the holes which are closed. As far as we know, this is the first 3D-hole closing algorithm.

Keywords

Initial Image Priority Level Simple Point Border Point Topological Number 
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.
    G. Bertrand. Characterization of three-dimensional holes. Internal report, 1992.Google Scholar
  2. 2.
    G. Bertrand. On the computation of topological numbers. In 4th Discrete geometry for computer imagery (DGCI'94), pages 137–146, September 1994.Google Scholar
  3. 3.
    G. Bertrand. Simple points, topological numbers and geodesic neighborhoods in cubic grids. Pattern Recognition Letter, 15:1003–1011, 1994.Google Scholar
  4. 4.
    G. Bertrand and G. Malandain. A new characterization of 3d simple points. Pattern Recognition Letter, 15:169–175, 1994.Google Scholar
  5. 5.
    G. Borgefors. Distance transforms in arbitrary dimension. Computer Vision, Graphics and Image Processing, 27:321–345, 1984.Google Scholar
  6. 6.
    J.M. Chassery and A. Montanvert. Géométrie discrète en analyse d'images. Hermès, 1991.Google Scholar
  7. 7.
    T.Y. Kong. A digital fundamental group. Computer Graphics, 13:159–166, 1989.Google Scholar
  8. 8.
    T.Y. Kong and A. Rosenfeld. Digital topology: introduction and survey. Computer Vision, Graphics and Image Processing, 48:357–393, 1989.Google Scholar
  9. 9.
    G. Malandain, G. Bertrand, and N. Ayache. Topological segmentation of discrete surfaces. Int. Journal of Comp. Vision, 10(2):183–197, 1993.Google Scholar
  10. 10.
    G. Malandain and S. Fernández Vidal. Topologically correct skeleton in n-d. In 5th Discrete geometry for computer imagery (DGCI'95), pages 199–208, September 1995.Google Scholar
  11. 11.
    J.F. Mangin, V. Frouin, I. Bloch, J. Regis, and J. Lòpez-Krahe. From 3d magnetic resonance images to structural representations of the cortex topography using topology preserving deformations. Journal of Mathematical Imaging and Vision, 5:297–318, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Zouina Aktouf
    • 1
  • Gilles Bertrand
    • 1
  • Laurent Perroton
    • 1
  1. 1.ESIEE Cité DescartesNoisy-Le-Grand CedexFrance

Personalised recommendations