检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:吴英杰 WU Yingjie(Zhuhai Surveying and Mapping Institute, Zhuhai Guangdong 519000, China)
机构地区:[1]珠海市测绘院,广东珠海519000
出 处:《北京测绘》2019年第4期448-453,共6页Beijing Surveying and Mapping
摘 要:本文提出了一种基于水平截面法的树木点云提取方法。首先联合三维格网和二维格网滤除地面和低矮地物的点云数据。其次运用水平截面法截取距地面一定高度的树干,将其投影到二维平面,利用八邻域算法进行聚类,根据聚类后的每一类树干点云数据,运用AlphaShape算法求取各个树干的轮廓线,将轮廓线的点连成多边形求取最小外接圆圆心即是该树的位置。最后利用树木的位置坐标和平面两点间的距离公式,依据最近距离原则遍历滤波后的点云,完成树木的分割。实验表明该方法可以较好地实现树木的提取,避免了传统树木提取方法中过度依靠经验值并且设置参数过多的弊端。This paper proposes a method of tree point cloud extraction based on horizontal section method. First, the 3D grid with the 2D grid are combined to filter point cloud of ground and low ground objects. Secondly, the horizontal section method is used to intercept trunk from a certain height from ground, project it into a two-dimensional plane, and then cluster by using the 8-neighbor algorithm. According to the point cloud of each type after clustering, the AlphaShape algorithm is used to obtain outline of each trunk. The discrete points are connected into a polygon, and the minimum circumscribed center of circle is obtained, that is the position of the tree. Finally, position coordinates of the tree and distance equation between the two points in the plane are used, according to the principle of nearest distance, the filtered point cloud is traversed to complete segmentation of tree. Experiments show that this method can better realize the extraction of trees, avoid disadvantages of excessive relying on empirical values and setting too many parameters in the traditional tree extraction method.
关 键 词:地面三维激光扫描(TLS) 三维格网 二维格网 点云滤波 水平截面法 树木提取
分 类 号:P237[天文地球—摄影测量与遥感]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28