基于圆柱面投影的树干表面重建算法
An Algorithm of Stem Surface Reconstruction Based on Cylindrical Projection
-
摘要: [目的] 树干在林业生产与科研中具有重要的地位，树干表面重建对森林可视化与树干参数提取具有重要意义，本研究以重建树干的精确表面模型为目的。[方法] 提出了一种基于圆柱面投影的树干表面重建算法，算法以连续的多个树干分段为重建单元，以重建单元的质心与直径构建圆柱面，通过将树干点云投影至圆柱面，再将圆柱面点云延伸展开得到平面点集，由平面点集Delaunay三角网的连接关系构建重建单元的不规则三角网表面，连接相邻重建单元的树干表面以获取树干整体的表面模型。[结果] 在树皮粗糙程度各异的3种树干点云上的实验表明：重建的树干表面能清晰地展示外业时标注的信息，能有效地反映树干表面的褶皱凸凹特征，具有更好的可视化效果；通过从重建表面上定量提取直径的精确性评价表明：与围尺实测直径相比，从本文提出的基于圆柱面投影重建的树干表面上提取树干直径的RMSE为0.14 cm，比基于切平面投影重建方法更精确。[结论] 本文提出的算法是一种简单高效的树干表面重建算法，无需计算法向量、重建的树干表面上三角形数量较少，且能有效地还原树干表面的凸凹特征，适用于树干表面的精确重建、精确可视化与树干参数提取。
-
关键词:
- 树干
- / 树木模型
- / Delaunay三角网
- / 表面重建
- / 圆柱面
Abstract: [Objective] To reconstruct the tree stem surface model. [Methods] A three-dimensional stem surface reconstruction algorithm based on cylindrical projection was presented. A number of consecutive slices were viewed as the reconstruction units. A cylinder was constructed by the centroid and diameter of the reconstruction unit. The stem points of reconstruction unit were transformed into cylindrical points, and then the cylindrical points were unfolded extendedly to planar points. The surface of reconstruction unit was reconstructed according to the connection among points in Delaunay triangulation created from planar point. The whole stem surface was obtained by connecting reconstructed surface of adjacent reconstruction unit. [Results] The experiment based on the stem point set of the barks of three tree species with different roughness showed that the reconstructed surface by proposed algorithm can showed information labeled in field work clearly and can exhibit the roughness characteristic of stem bark. By comparing with other three surface reconstruction algorithms, the proposed algorithm showed better visualization effect. Through quantitative analysis of diameter extracting from reconstructed surface, and comparing with the diameter by tape diameter in field work, the RMSE value of diameter extracting surface reconstructed by proposed algorithm was 0.14 cm and the surface reconstructed by proposed algorithm was more accurate than the algorithm of tangent based. [Conclusion] The present method is a simple, efficient and accurate one for stem surface reconstruction without calculating the normal vector and needs fewer surface triangles. It can effectively exhibit the surface features of the stem. The proposed algorithm was suitable for surface reconstruction, exact visualization of the stem and extracting stem parameters in an exact way.-
Key words:
- stem
- / tree model
- / Delaunay triangulation
- / surface reconstruction
- / cylindrical surface
-
[1] 黄洪宇, 陈崇成, 邹杰, 等. 基于地面激光雷达点云数据的单木三维建模综述[J]. 林业科学, 2013,49(4):123-130. [2] Ben Gorte, Norbert Pfeifer. Structuring laser-scanned trees using 3D mathematical morphology[J]. International Archives of Photogrammetry and Remote Sensing, 2004, 35(B5):929-933. [3] Norbert Pfeifer, Ben Gorte, Daniel Winterhalder, Automatic reconstruction of single trees from terrestrial laser scanner data. In Proceedings of 20th ISPRS Congress, 2004, 114-119. [4] Jan Hackenberg, Heinrich Spiecker, Kim Calders, et al. SimpleTree—An Efficient Open Source Tool to Build Tree Models from TLS Clouds[J]. Forests, 2015,6(11):4245. [5] Zhanglin Cheng, Xiaopeng Zhang, Thierry Fourcaud, Tree skeleton extraction from a single range image. In Plant Growth Modeling and Applications, 2006. PMA'06. Second International Symposium on IEEE, Beijing, 2006,274-281. [6] Hui Xu, Nathan Gossett, Baoquan Chen. Knowledge and heuristic-based modeling of laser-scanned trees[J]. ACM Transactions on Graphics (TOG), 2007,26(4):19. [7] 王晓辉, 黄洪宇, 陈崇成, 等. 基于激光点云的树木三维几何建模系统的设计与实现[J]. 福州大学学报:自然科学版, 2014,42(5):705-712. [8] Peethambaran J, Muthuganapathy R. Reconstruction of water-tight surfaces through Delaunay sculpting[M]. Computer-aided Design, 2015,58: 62-72. [9] 高士增, 张怀清, 刘闽, 等. 树木枝干 Delaunay 三角网格构建技术[J]. 西南林业大学学报, 2013,33(3):62-68. [10] 唐艺. 基于三维激光扫描技术的活立木材积测量方法. 北京:北京林业大学, 2012. [11] 金涛, 陈建良. 逆向工程技术研究进展[J]. 中国机械工程, 2002,13(16):1430-1436. [12] 伍龙华, 黄惠. 点云驱动的计算机图形学综述[J]. 计算机辅助设计与图形学学报, 2015, 27(8): 1341-1353. [13] Hugues Hoppe, Tony DeRose, Tom Duchamp, et al.. Surface reconstruction from unorganized points[M]. ACM. 1992. [14] Jonathan C Carr, Richard K Beatson, Jon B Cherrie, et al. Reconstruction and representation of 3D objects with radial basis functions. In Proceedings of the 28th annual conference on computer graphics and interactive techniques ACM, 2001, 67-76. [15] Michael Kazhdan, Matthew Bolitho, Hugues Hoppe, Poisson surface reconstruction. In Proceedings of the fourth Eurographics symposium on Geometry processing. 2006. [16] Gopi M, Shankar Krishnan, Cláudio T Silva, Surface reconstruction based on lower dimensional localized Delaunay triangulation. In Computer Graphics Forum Wiley Online Library, 2000,467-478. [17] Mark De Berg, Marc Van Kreveld, Mark Overmars, et al., Computational geometry[M]. Springer, 2000. [18] 尤磊,唐守正, 宋新宇. 以优先点为中心的Delaunay三角网生长算法[J]. 中国图象图形学报, 2016,26(1):60-68. [19] Radu Bogdan Rusu, Steve Cousins,. 3d is here: Point cloud library(pcl). In Robotics and Automation (ICRA), 2011 IEEE International Conference on IEEE, 2011,1-4. [20] Nina Amenta, Sunghee Choi, Ravi Krishna Kolluri, The power crust. In Proceedings of the sixth ACM symposium on Solid modeling and applications ACM, 2001,249-266. -
点击查看大图
计量
- 文章访问数: 2805
- HTML全文浏览量: 207
- PDF下载量: 688
- 被引次数: 0
下载:
