Skip to main content

Skeletonization of Laser-Scanned Trees in the 3D Raster Domain

  • Chapter

Part of the book series: Lecture Notes in Geoinformation and Cartography ((LNGC))

Abstract

The paper introduces storage and processing of 3-dimensional point clouds, obtained by terrestrial laser scanning, in the 3D raster domain. The objects under consideration are trees in production orchards. The purpose is to automatically identify the structure of such trees in terms of the number of branches, their lengths and their thicknesses. An important step in the process is skeletonization. On the basis of a previously developed methodology, a new skeletonization algorithm is developed, which delivers improved results.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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. K. Palágyi, E. Sorantin, E. Balogh, A. Kuba, Cs. Halmai, B. Erdôhelyi, K. Hausegger: A sequential 3D thinning algorithm and its medical applications, in Proc. 17th Int. Conf. Information Processing in Medical Imaging, IPMI 2001, Davis, USA, Lecture Notes in Computer Science, Springer, 2001

    Google Scholar 

  2. Gunilla Borgefors, Ingela Nyström and Gabriella Sanniti Di Baja, Computing skeletons in three dimensions, Pattern Recognition 32 (1999) 1225–1236.

    Article  Google Scholar 

  3. Cristophe Lohou and Gilles Bertrand, A new 3D 12-subiteration thinning algorithm based on P-simple points, IWCIA, 2001.

    Google Scholar 

  4. K. Palágyi, J. Tschirren, M. Sonka: Quantitative analysis of intrathoracic airway trees: methods and validation, LNCS 2732, Springer, 2003, 222–233.

    Google Scholar 

  5. K. Palágyi, E. Sorantin, E. Balogh, A. Kuba, C. Halmai, B. Erdöhelyi and K. Hausegger, A sequential 3D thinnig algorithm and its medical apllications, in M.F. Insana and R.M. Leahy (Eds.): IPMI 2001, LNCS 2082, Springer 2001, pp.409–415.

    Google Scholar 

  6. Kálmán Palágyi and Attila Kuba, Directional 3D thinning using 8 subiterations, LNCS 1568, Springer, 1999, 325–336.

    Google Scholar 

  7. Norbert Pfeifer and Ben Gorte, Automatic reconstruction of single trees from terrestrial laser scans, IAPRS 35, Istanbul.

    Google Scholar 

  8. J. Serra, Image Analysis and Mathematical Morphology, Academic Press, London, 1982.

    Google Scholar 

  9. Alexandra Telea and Anna Vilanova, A robust level-set algorithms for centerline extraction, Joint EUROGRAPHICS-IEEE Symposium on Visualisation (2003)

    Google Scholar 

  10. B. Verwer, Local Distances for Distance Transformations in Two and Three Dimensions, Pattern Recognition Letters Vol.12, No. 11 (1991), 671–682

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gorte, B. (2006). Skeletonization of Laser-Scanned Trees in the 3D Raster Domain. In: Abdul-Rahman, A., Zlatanova, S., Coors, V. (eds) Innovations in 3D Geo Information Systems. Lecture Notes in Geoinformation and Cartography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36998-1_29

Download citation

Publish with us

Policies and ethics