CASIA OpenIR  > 模式识别国家重点实验室  > 多媒体计算与图形学
Efficient and Robust Reconstruction of Botanical Branching Structure from Laser Scanned Points
Yan, Dong-Ming; Wintz, Julien; Mourrain, Bernard; Wang, Wenping; Boudon, Frédéric; Godin Christophe
2009
Conference Name11th IEEE CAD/Graphics, 2009
Conference Date2009-08
Conference PlaceHuangShan
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.
Document Type会议论文
Identifierhttp://ir.ia.ac.cn/handle/173211/14020
Collection模式识别国家重点实验室_多媒体计算与图形学
Recommended Citation
GB/T 7714
Yan, Dong-Ming,Wintz, Julien,Mourrain, Bernard,et al. Efficient and Robust Reconstruction of Botanical Branching Structure from Laser Scanned Points[C],2009.
Files in This Item: Download All
File Name/Size DocType Version Access License
2009_CADCG_Tree.pdf(3568KB)会议论文 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yan, Dong-Ming]'s Articles
[Wintz, Julien]'s Articles
[Mourrain, Bernard]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yan, Dong-Ming]'s Articles
[Wintz, Julien]'s Articles
[Mourrain, Bernard]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yan, Dong-Ming]'s Articles
[Wintz, Julien]'s Articles
[Mourrain, Bernard]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: 2009_CADCG_Tree.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.