Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Combinatorial Image Analysis

IWCIA 2004: Combinatorial Image Analysis pp 164–175Cite as

3D Topological Thinning by Identifying Non-simple Voxels

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3322))

Abstract

Topological thinning includes tests for voxels to be simple or not. A point (pixel or voxel) is simple if the change of its image value does not change the topology of the image. A problem with topology preservation in 3D is that checking voxels to be simple is more complex and time consuming than in 2D. In this paper, we review some characterizations of simple voxels and we propose a new methodology for identifying non-simple points. We implemented our approach by modifying an existing 3D thinning algorithm and achieved an improved running time.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arcelli, C., Sanniti di Baja, G.: Skeletons of planar patterns. In: Kong, T.Y., Rosenfeld, A. (eds.) Topological Algorithms for Digital Image Processing, pp. 99–143. North-Holland, Amsterdam (1996)

    Chapter  Google Scholar 

  2. Bertrand, G., Maladain, G.: A new characterization of three-dimensional simple points. Pattern Recognition Letters 15, 169–175 (1994)

    Article  MATH  Google Scholar 

  3. Bertrand, G.: Simple points, topological numbers and geodesic neighborhoods in cubic grids. Pattern Recognition Letters 15, 1003–1011 (1994)

    Article  Google Scholar 

  4. Fourey, S., Malgouyres, R.: A concise characterization of 3D simple points. Discrete Applied Mathematics 125, 59–80 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gau, C.J., Kong, T.Y.: 4D Minimal Non-simple Sets. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, pp. 81–91. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Hall, R.W.: Fast parallel thinning algorithms: parallel speed and connectivity preservation. Comm. ACM 32, 124–131 (1989)

    Article  MathSciNet  Google Scholar 

  7. Hall, R.W.: Parallel connectivity-preserving thinning algorithms. In: Kong, T.Y., Rosenfeld, A. (eds.) Topological algorithms for Digital Image Processing, pp. 145–179. North-Holland, Amsterdam (1996)

    Chapter  Google Scholar 

  8. Hilditch, C.J.: Linear skeletons from square cupboards. In: Meltzer, B., Mitchie, D. (eds.) Machine Intelligence 4, pp. 403–420. Edinburgh University Press, Edinburgh (1969)

    Google Scholar 

  9. Klette, G.: Characterizations of simple pixels in binary images. In: Proceedings: Image and Vision Computing New Zealand 2002, Auckland, pp. 227–232 (2002)

    Google Scholar 

  10. Klette, G.: A Comparative Discussion of Distance Transformations and Simple Deformations in Digital Image Processing. Machine Graphics & Vision 12, 235–256 (2003)

    MathSciNet  Google Scholar 

  11. Klette, G.: Simple Points in 2D and 3D Binary Images. In: Petkov, N., Westenberg, M.A. (eds.) CAIP 2003. LNCS, vol. 2756, pp. 57–64. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Kong, T.Y.: On topology preservation in 2-D and 3-D thinning. Int. J. for Pattern Recognition and Artificial Intelligence 9, 813–844 (1995)

    Article  Google Scholar 

  13. Lee, C.N., Rosenfeld, A.: Simple connectivity is not locally computable for connected 3D images. Computer Vision, Graphics, and Image Processing 51, 87–95 (1990)

    Article  Google Scholar 

  14. Lohou, C., Bertrand, G.: A New 3D 6-Subiteration Thinning Algorithm Based on P-Simple Points. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, pp. 102–113. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Maladain, G., Bertrand, G.: Fast characterization of 3D simple points. In: Proc. 11th IAPR Int. Conf. on Pattern Recognition, The Hague, The Netherlands, vol. III, pp. 232–235 (1992)

    Google Scholar 

  16. Palagyi, K., Sorantin, E., Balogh, E., Kuba, A., Halmai, C., Erdohelyi, B., Hausegger, K.: A Sequential 3D Thinning Algorithm and Its Medical Applications. In: Insana, M.F., Leahy, R.M. (eds.) IPMI 2001. LNCS, vol. 2082, pp. 409–415. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Palagyi, K., Kuba, A.: Directional 3D Thinning Using 8 Subiterations. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 325–336. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Palagyi, K., Kuba, A.: A 3D 6-subiteration thinning algorithm for extracting medial lines. Pattern Recognition Letters 19, 613–627 (1998)

    Article  MATH  Google Scholar 

  19. Saha, P.K., Chanda, B., Majumder, D.D.: Principles and algorithms for 2D and 3D shrinking, Tech. Rep. TR/KBCS/2/91, NCKBCS Library, Indian Statistical Institute, Calcutta, India (1991)

    Google Scholar 

  20. Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Comm. ACM 13, 471–494 (1966)

    MATH  Google Scholar 

  21. Rosenfeld, A.: Connectivity in digital pictures. Comm. ACM 17, 146–160 (1970)

    MATH  MathSciNet  Google Scholar 

  22. Rosenfeld, A., Kong, T.Y., Nakamura, A.: Topology- preserving deformations of two-valued digital pictures. Graphical Models and Image Processing 60, 24–34 (1998)

    Article  Google Scholar 

  23. Serra, J.: Image Analysis and Mathematical Morphology, vol. 2. Academic Press, New York (1982)

    MATH  Google Scholar 

  24. Yokoi, S., Toriwaki, J.I., Fukumura, T.: An analysis of topological properties of digitized binary pictures using local features. Computer Graphics and Image Processing 4, 63–73 (1975)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CITR, University of Auckland, Tamaki Campus, Building 731, Auckland, New Zealand

    Gisela Klette & Mian Pan

Authors
  1. Gisela Klette
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mian Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University of Auckland, New Zealand

    Reinhard Klette

  2. Computer Science, Exeter University, Harrison Building, EX4 4QF, Exeter, U.K.

    Joviša Žunić

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klette, G., Pan, M. (2004). 3D Topological Thinning by Identifying Non-simple Voxels. In: Klette, R., Žunić, J. (eds) Combinatorial Image Analysis. IWCIA 2004. Lecture Notes in Computer Science, vol 3322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30503-3_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30503-3_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23942-0

  • Online ISBN: 978-3-540-30503-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation