高级检索

长测距地基点云密度自适应平面分割算法

Density adaptive plane segmentation from long-range point cloud

  • 摘要: 为了解决长测距地面激光点云高密度变化的问题,采用了一种密度自适应的平面分割方法。首先基于估算理论点间距构建动态邻域搜索范围,联合内指标和香农熵确定最佳邻域并计算维度特征;然后根据最佳邻域、维度特征、法向量和点面距设计区域增长规则,得到初步分割结果;最终通过面片合并优化分割结果,并在最长扫描距离为1 km的单站地面激光扫描数据进行了实验验证。结果表明,该方法分割准确率达到95%,召回率达到92%,能够准确对长测距地基点云中的建筑物平面进行分割;与传统香农熵方法相比,本文中使用动态邻域搜索范围可以显著提高算法效率。该方法能高效准确地从大场景点云中提取建筑物平面,为城市3维建模提供了参考。

     

    Abstract: To solve the problem that high density variation of long-range terrestrial laser scanning(TLS) point cloud, a density adaptive segmentation algorithm for extracting building plane was proposed in this paper. Firstly, the dynamic neighborhood search range was constructed based on the estimated theoretical point space, and the optimal neighborhood can be selected by internal indexes and Shannon entropy. Then, the dimensionality feature was calculated by using this neighborhood. Secondly, the region growing algorithm rules were set according to the optimal neighborhood, normal vector, dimensionality feature and point-to-plane distance to extract preliminary plane segmentation results. Finally, the segmentation result was optimized by patch merging, and then was tested on a single-site TLS data with scanning distance of 1 km. The result shows that the precision reaches 95%, the recall reaches 92%. This method can segment the building plane in the long-range TLS point cloud effectively. Compared with the traditional Shannon entropy method, the dynamic neighborhood search range used in this paper can significantly improve the efficiency of the algorithm. This method can efficiently and accurately extract the building planes from wide scene, and provide a reference for urban 3-D modeling.

     

/

返回文章
返回