Efficient and robust reconstruction of botanical branching structure from laser scanned points - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Efficient and robust reconstruction of botanical branching structure from laser scanned points

(1) , (2) , (2) , (3) , (4, 5) , (4, 5)
1
2
3
4
5

Abstract

This paper presents a reconstruction pipeline for recovering branching structure of trees from laser scanned data points. The process is made up of two main blocks: segmentation and reconstruction. Based on a variational k-means clustering algorithm, cylindrical components and ramified regions of data points are identified and located. An adjacency graph is then built from neighborhood information of components. Simple heuristics allow us to extract a skeleton structure and identify branches from the graph. Finally, a B-spline model is computed to give a compact and accurate reconstruction of the branching system.
Fichier principal
Vignette du fichier
main.pdf (1.86 Mo) Télécharger le fichier
Vignette du fichier
melgueil_3.png (44.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

inria-00436480 , version 1 (26-11-2009)

Identifiers

  • HAL Id : inria-00436480 , version 1

Cite

Dong-Ming Yan, Julien Wintz, Bernard Mourrain, Wenping Wang, Frédéric Boudon, et al.. Efficient and robust reconstruction of botanical branching structure from laser scanned points. CAD/Graphics 2009, Aug 2009, Yellow Mountain City, China. pp.572-575. ⟨inria-00436480⟩
486 View
847 Download

Share

Gmail Facebook Twitter LinkedIn More