Efficient and robust reconstruction of botanical branching structure from laser scanned points
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.
Dong-Ming Yan Julien Wintz Bernard Mourrain Wenping Wang Frédéric Boudon Christophe Godin
Dept. of CS Univ. of Hong Kong Hong Kong, China Project Galaad Inria Sophia-Antipolis, France Dept. of CS Univ. of HongKong Hong Kong, China Project Virtual Plants Inria Montpellier, France
国际会议
黄山
英文
572-575
2009-08-19(万方平台首次上网日期,不代表论文的发表时间)