Skip to main content
SpringerLink
Log in

Fast Algorithm for Order Independent Binary Homotopic Thinning

  • Conference paper
Adaptive and Natural Computing Algorithms (ICANNGA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4432))

Included in the following conference series:

Abstract

In this paper an efficient queue-based algorithm for order independent homotopic thinning is proposed. This generic algorithm can be applied to various thinning versions: homotopic marking, anchored skeletonisation, and the computation of the skeleton of influence zones based on local pixel characterisations. An example application of the proposed method to detect the medial axis of wide river networks from satellite imagery is also presented.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Iwanowski, M., Soille, P.: Order independence in binary 2D homotopic thinning. In: Kuba, A., Nyúl, L.G., Palágyi, K. (eds.) DGCI 2006. LNCS, vol. 4245, pp. 592–604. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Rosenfeld, A.: Connectivity in digital pictures. Journal of the ACM 17(1), 146–160 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kong, T., Rosenfeld, A.: Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing 48, 357–393 (1989)

    Article  Google Scholar 

  4. Kong, T.: On topology preservation in 2-D and 3-D thinning. International Journal of Pattern Recognition and Artificial Intelligence 9(5), 813–844 (1995)

    Article  Google Scholar 

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

    MATH  Google Scholar 

  6. Soille, P.: Morphological Image Analysis: Principles and Applications (corrected 2nd printing of the 2nd edn.). Springer, Berlin (2004)

    Google Scholar 

  7. Ranwez, V., Soille, P.: Order independent homotopic thinning for binary and grey tone anchored skeletons. Pattern Recognition Letters 23(6), 687–702 (2002)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Serra, J.: Image analysis and mathematical morphology. Volume 2: Theoretical advances. Academic Press, London (1988)

    Google Scholar 

  10. Couprie, M., Bertrand, G.: Tesselations by connection. Pattern Recognition Letters 23, 637–647 (2002)

    Article  MATH  Google Scholar 

  11. Vincent, L.: Efficient computation of various types of skeletons. In: Loew, M. (ed.) Medical Imaging V: Image Processing. Proc. SPIE, vol. 1445, pp. 297–311 (1991)

    Google Scholar 

  12. Davies, E., Plummer, A.: Thinning algorithms: a critique and a new methodology. Pattern Recognition 14, 53–63 (1981)

    Article  MathSciNet  Google Scholar 

  13. Pudney, C.: Distance-ordered homotopic thinning: a skeletonization algorithm for 3D digital images. Computer Vision and Image Understanding 72(3), 404–413 (1998)

    Article  Google Scholar 

  14. Ranwez, V., Soille, P.: Order independent homotopic thinning. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 337–346. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  15. Rosenfeld, A., Pfaltz, J.: Distance functions on digital pictures. Pattern Recognition 1, 33–61 (1968)

    Article  MathSciNet  Google Scholar 

  16. Danielsson, P.-E.: Euclidean distance mapping. Computer Graphics and Image Processing 14, 227–248 (1980)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Control and Industrial Electronics, Warsaw University of Technology, ul.Koszykowa 75, 00-662 Warszawa, Poland

    Marcin Iwanowski

  2. Institute for Environment and Sustainability, DG Joint Research Centre, European Commission, T.P. 262, I-21020 Ispra (VA), Italy

    Pierre Soille

Authors
  1. Marcin Iwanowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Soille
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bartlomiej Beliczynski Andrzej Dzielinski Marcin Iwanowski Bernardete Ribeiro

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Iwanowski, M., Soille, P. (2007). Fast Algorithm for Order Independent Binary Homotopic Thinning. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71629-7_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71629-7_68

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-71629-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation