Skip to main content
SpringerLink
Log in

New 2D Parallel Thinning Algorithms Based on Critical Kernels

  • Conference paper
Combinatorial Image Analysis (IWCIA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 4040))

Included in the following conference series:

Abstract

Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. In this context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, and to the inclusion of the topological axis which may be seen as a generalization of the medial axis.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arcelli, C., Cordella, L.P., Levialdi, S.: Parallel thinning of binary pictures. Electronic Letters 11(7), 148–149 (1975)

    Article  Google Scholar 

  2. Bertrand, G.: On P-simple points. Comptes Rendus de l’Académie des Sciences, Série Math. I(321), 1077–1084 (1995)

    MathSciNet  Google Scholar 

  3. Bertrand, G.: On critical kernels. Internal Report, Université de Marne-la-Vallée, IGM2005-05 (2005); Submitted for publication

    Google Scholar 

  4. Bertrand, G., Couprie, M.: Three-dimensional parallel thinning algorithms based on critical kernels (in preparation)

    Google Scholar 

  5. Bertrand, G., Couprie, M.: Two-dimensional parallel thinning algorithms based on critical kernels. Internal Report, Université de Marne-la-Vallée, IGM2006-02 (2006); Submitted for publication

    Google Scholar 

  6. Burguet, J., Malgouyres, R.: Strong thinning and polyhedric approximation of the surface of a voxel object. Discrete Applied Mathematics 125, 93–114 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chin, R.T., Wan, H.K., Stover, D.L., Iverson, R.D.: A one-pass thinning algorithm and its parallel implementation. Computer Vision, Graphics, and Image Processing 40(1), 30–40 (1987)

    Article  Google Scholar 

  8. Couprie, M.: Note on fifteen 2d parallel thinning algorithms. Internal Report, Université de Marne-la-Vallée, IGM2006-01 (2005)

    Google Scholar 

  9. Eckhardt, U., Maderlechner, G.: Invariant thinning. International Journal of Pattern Recognition and Artificial Intelligence 7(5), 1115–1144 (1993)

    Article  Google Scholar 

  10. Giblin, P.: Graphs, surfaces and homology. Chapman and Hall, Boca Raton (1981)

    MATH  Google Scholar 

  11. Hall, R.W.: Fast parallel thinning algorithms: Parallel speed and connectivity preservation. Communication of the ACM 32(1), 124–131 (1989)

    Article  Google Scholar 

  12. Hall, R.W.: Tests for connectivity preservation for parallel reduction operators. Topology and its Applications 46(3), 199–217 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jang, B.K., Chin, R.T.: Reconstructable parallel thinning. Pattern Recognition and Artificial Intelligence 7, 1145–1181 (1993)

    Article  Google Scholar 

  14. Kong, T.Y.: On topology preservation in 2-d and 3-d thinning. International Journal on Pattern Recognition and Artificial Intelligence 9, 813–844 (1995)

    Article  Google Scholar 

  15. Kong, T.Y.: Topology-preserving deletion of 1’s from 2-, 3- and 4-dimensional binary images. In: Ahronovitz, E. (ed.) DGCI 1997. LNCS, vol. 1347, pp. 3–18. Springer, Heidelberg (1997)

    Google Scholar 

  16. Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comp. Vision, Graphics and Image Proc. 48, 357–393 (1989)

    Article  Google Scholar 

  17. Kovalevsky, V.A.: Finite topology as applied to image analysis. Computer Vision, Graphics and Image Processing 46, 141–161 (1989)

    Article  Google Scholar 

  18. Manzanera, A., Bernard, T.M.: Metrical properties of a collection of 2d parallel thinning algorithms. In: Proc. 9th IWCIA, Electronic Notes on Discrete Mathematics, vol. 12 (2003)

    Google Scholar 

  19. Pavlidis, T.: An asynchronous thinning algorithm. Computer Graphics and Image Processing 20(2), 133–157 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  20. Ronse, C.: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics 21(1), 67–79 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  21. Rosenfeld, A.: Connectivity in digital pictures. Journal of the Association for Computer Machinery 17, 146–160 (1970)

    MATH  MathSciNet  Google Scholar 

  22. Rosenfeld, A., Pfaltz, J.L.: Sequential operations in digital picture processing. Journal of the Association for Computer Machinery 13, 471–494 (1966)

    MATH  Google Scholar 

  23. Rutovitz, D.: Pattern recognition. Journal of the Royal Statistical Society 129, 504–530 (1966)

    Google Scholar 

  24. Serra, J.: Image analysis and mathematical morphology. Academic Press, London (1982)

    MATH  Google Scholar 

  25. Stefanelli, R., Rosendeld, A.: Some parallel thinning algorithms for digital pictures. Journal of the Association for Computing Machinery 18(2), 255–264 (1971)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Gaspard-Monge, Laboratoire A2SI, Groupe ESIEE, Cité Descartes, BP 99, 93162 Cedex, Noisy-le-Grand, France

    Gilles Bertrand & Michel Couprie

Authors
  1. Gilles Bertrand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Couprie
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Transport Research, German-Aerospace Center (DLR), Rutherfordstr. 2, 12489, Berlin, Germany

    Ralf Reulke

  2. Fachbereich Mathematik, Universität Hamburg, Bundesstr. 55, 20146, Hamburg

    Ulrich Eckardt

  3. Dresden University of Technology,  

    Boris Flach

  4. Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Uwe Knauer

  5. FU Berlin, Arnimallee 3, 14195, Berlin, Germany

    Konrad Polthier

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertrand, G., Couprie, M. (2006). New 2D Parallel Thinning Algorithms Based on Critical Kernels. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds) Combinatorial Image Analysis. IWCIA 2006. Lecture Notes in Computer Science, vol 4040. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11774938_5

Download citation

  • DOI: https://doi.org/10.1007/11774938_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35153-5

  • Online ISBN: 978-3-540-35154-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation