欢迎访问林业资源管理

林业资源管理 ›› 2022, Vol. 0 ›› Issue (1): 124-131.doi: 10.13466/j.cnki.lyzygl.2022.01.015

• 技术应用 • 上一篇    下一篇

基于多层K-means在森林点云中的单木识别算法

谷志新(), 裴方睿   

  1. 东北林业大学 信息与计算机工程学院,哈尔滨150040
  • 收稿日期:2021-12-15 修回日期:2022-01-06 出版日期:2022-02-28 发布日期:2022-03-31
  • 作者简介:谷志新(1977-),女,黑龙江哈尔滨人,副教授,博士,硕导,研究方向为智能算法。Email: 57038432@qq.com
  • 基金资助:
    国家自然科学基金面上项目(51975114);中央高校基本科研业务费(2572017CB08)

Single Tree Recognition Algorithm Based on Multi-Layer K-means in Forest Point Cloud

GU Zhixin(), PEI Fangrui   

  1. Information and Computer Engineering College,Northeast Forestry University,Harbin 150040,China
  • Received:2021-12-15 Revised:2022-01-06 Online:2022-02-28 Published:2022-03-31

摘要:

针对目前激光雷达(Light Detection And Ranging,LIDAR)采集的森林点云数据使用K-means算法进行单木识别时,算法的收敛时间长,以及对于株树密度大的森林场景容易产生过聚类的问题,提出了一种改进的多层K-means单木识别算法。以黑龙江省佳木斯市孟家岗林场落叶松人工林的点云数据为实验对象,通过RANSAC算法和半径离群值算法去除数据中的地面点与非树干且非地面点,最后通过多层K-means算法进行单木的识别。结果表明,改进后的多层K-means算法单木识别的识别率达到了91.01%,误判树木的数量为0,算法收敛时间相较于传统K-means算法缩短了48.13%。可以得出结论,多层K-means算法效率更高,对复杂密集的林分样地进行单木识别有更好的效果,降低了勘测森林结构的成本,这对于森林结构参数的测算、森林资源的保护与总体规划工作有重要意义。

关键词: 森林结构, 点云数据, K-means算法, 单木识别, 激光雷达

Abstract:

When the K-means algorithm is used for single tree recognition for the forest point cloud data collected by the current Lidar (Light Detection And Ranging,LIDAR),the algorithm has a long convergence time and is prone to clustering for forest scenes with high density of trees. An improved multi-layer K-means single tree recognition algorithm was proposed.Taking the point cloud data of the Larix olgensis plantation in Mengjiagang Forest Farm in Jiamusi City,Heilongjiang Province as the experimental object,the RANSAC algorithm and radius outlier denoising algorithm were used to remove ground points and non-trunk and non-ground points in the data.Finally,the single tree recognition was carried out through the multi-layer K-means algorithm.The results showed that the improved multi-layer K-means algorithm had a single tree recognition accuracy rate of 91.01% and the false calculation amount of the trees was 0.Compared with the traditional K-means algorithm,the convergence time of the algorithm was shortened by 48.13%.It can be concluded that the multi-layer K-means algorithm is more efficient,and single tree identification in complex and dense forest plots has better results.The cost of surveying forest structure is reduced,which is of great significance to the calculation of forest structure parameters,the protection of forest resources and the overall planning.

Key words: forest structure, point cloud data, K-means algorithm, single tree recognition, Light Detection And Ranging

中图分类号: