a. obtaining lidar data points of a group of one or more trees;b. define voxels in a regular 3D grid on the basis of the data points;c. applying an image segmentation algorithm to obtain at least one segment;and, if at least two segments are obtained:d. find the root voxel and branch voxels of a first segment and a second neighbouring segment; ande. merging the first and second segment if the distance between the first and second root voxel is less than a first threshold, the distance between the first root voxel and the closest second branch voxel is less than a second threshold; and the distance between the first branch voxels and the second branch voxels is less than a third threshold."/> Method for identifying individual trees in airborne lidar data and corresponding computer program product
首页> 外国专利> Method for identifying individual trees in airborne lidar data and corresponding computer program product

Method for identifying individual trees in airborne lidar data and corresponding computer program product

机译:机载激光雷达数据中识别单个树木的方法及相应的计算机程序产品

摘要

The invention relates to a method for identifying individual trees in airborne lidar data and a corresponding computer program product. The method comprises:a. obtaining lidar data points of a group of one or more trees;b. define voxels in a regular 3D grid on the basis of the data points;c. applying an image segmentation algorithm to obtain at least one segment;and, if at least two segments are obtained:d. find the root voxel and branch voxels of a first segment and a second neighbouring segment; ande. merging the first and second segment if the distance between the first and second root voxel is less than a first threshold, the distance between the first root voxel and the closest second branch voxel is less than a second threshold; and the distance between the first branch voxels and the second branch voxels is less than a third threshold.
机译:本发明涉及一种用于识别机载激光雷达数据中的单个树木的方法以及相应的计算机程序产品。该方法包括: a。获得一组一棵或多棵树的激光雷达数据点; b。根据数据点在常规3D网格中定义体素; c。应用图像分割算法以获得至少一个分段; ,并且,如果获得了至少两个分段: d。查找第一段和第二相邻段的根体素和分支体素;和 e。如果第一根体素与第二根体素之间的距离小于第一阈值,则合并第一段与第二段,则第一根体素与最近的第二分支体素之间的距离小于第二阈值;并且第一分支体素与第二分支体素之间的距离小于第三阈值。

著录项

  • 公开/公告号US10768303B2

    专利类型

  • 公开/公告日2020-09-08

    原文格式PDF

  • 申请/专利权人 YADO HOLDING B.V.;BIAO XIONG;

    申请/专利号US201615755100

  • 发明设计人 BIAO XIONG;DONG YANG;

    申请日2016-08-24

  • 分类号G06K9;G01S17/89;G06T7/11;G06T3;

  • 国家 US

  • 入库时间 2022-08-21 11:28:10

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号