地球信息科学学报

地球信息科学学报 ›› 2019, Vol. 21 ›› Issue (2): 236-248.doi: 10.12082/dqxxkx.2019.180223

• 遥感科学与应用技术 • 上一篇    下一篇

骨架优化下的地面激光树木点云重建方法

陈动1(), 张振鑫2,*(), 王臻3, 云挺4, 丁惠倩5   

  1. 1. 南京林业大学土木工程学院,南京 210037
    2. 首都师范大学资源环境与旅游学院,北京 100048
    3. 中国地质大学（北京）土地科学技术学院,北京 100083
    4. 南京林业大学信息科学技术学院, 南京 210037
    5. 北京师范大学遥感科学国家重点实验室,北京 100875
  • 收稿日期:2018-05-05 修回日期:2018-10-17 出版日期:2019-02-20 发布日期:2019-01-30
  • 作者简介:

    作者简介：陈 动（1981-）,男,山东临沂人,博士,主要从事机载激光点云的分类、分割、识别和重建研究。E-mail: chendong@njfu.edu.cn

  • 基金资助:
    国家自然科学基金项目（41301521、41701533、31770591）

Individual Tree Modeling from Terrestrial Laser Scanning Point Clouds via Skeleton-based Optimization

Dong CHEN1(), Zhenxin ZHANG2,*(), Zhen WANG3, Ting YUN4, Huiqian DING5   

  1. 1. College of Civil Engineering, Nanjing Forestry University, Nanjing 210037, China
    2. College of Resource Environment and Tourism, Capital Normal University, Beijing 100048, China
    3. School of Land Science and Technology, China University of Geosciences, Beijing 100083, China
    4. College of Information Science and Technology, Nanjing Forestry University, Nanjing 210037, China
    5. State Key Laboratory of Remote Sensing Science, Beijing Normal University, Beijing 100875, China
  • Received:2018-05-05 Revised:2018-10-17 Online:2019-02-20 Published:2019-01-30
  • Contact: Zhenxin ZHANG
  • Supported by:
    National Natural Science Founda tion of China, No.41301521, 41701533, 31770591

RichHTML

PDF (PC)

赞

被引次数

1

摘要：

本文针对地基式激光雷达扫描点云的分布特征,提出一种基于骨架优化的三维树木重建方法。首先从原始点云中提取出树木的“类主干点”,利用无向图数据结构存储和组织点云,然后基于“主干点”约束下的最小生成树算法生成单株树木的初始骨架,最后通过“密度调整”和“树枝平滑”优化操作,建立高逼真度的三维树木模型。本文提出的树木几何重建算法对点云数据缺失和点云的密度不敏感,对试验区不同的树种建模具有较高的鲁棒性。另外,本文通过对不同密度的点云和不同抽稀层次下的点云进行效率测试,发现结合类主干点表达和点云抽稀能共同确保本文算法可以重建大场景TLS植被点云数据。

关键词: 地基式激光雷达, 最小生成树, 骨架, 树木几何模型, 骨架优化

Abstract:

In this paper, we propose a methodology to reconstruct the individual-tree models from Terrestrial Laser Scanning (TLS) point clouds via skeleton-based optimization. The proposed method is a data-driven method, and in theory, it can generate any geometric shapes of different tree species. Mathematically, the salient points reflected from trunks and remarkable branches have been successfully recognized by using statistical analysis method. Then, we organize the raw points via an undirected graph, from which the initial skeleton of individual tree is created by using the Minimum Spanning Tree (MST) algorithm under the constraint of salient points. The initial skeleton tree models are further enhanced and refined through a series of optimizations, i.e., point density adjustment and branch smoothing. The tree skeletal structure is inflated into a tree model by simultaneous combination of a robust cylinder fitting method and allometric model. The tree leaves are finally properly added into the tree models, thereby enhancing the photorealistic representation of the geometric tree models. Various experiments on different tree species captured at Nanjing Forestry University show that the proposed methodology is insensitive to the point density and data missing, and meanwhile can generate meaningful and accurate individual geometric tree models. In addition, it is to be found that our modeling tree algorithm based on salient points and sampling strategy can reach the optimal computational efficiency, compared to that only using the salient points or the original laser scanning tree points as inputs. This enhancement in the efficiency can significantly expand our current individual tree modeling into the reconstruction of large-scale scanning scenes.

Key words: Terrestrial Laser Scanning (TLS), Minimum Spanning Tree (MST), tree skeleton, tree model, skeleton optimization