首页> 外文期刊>Journal of the Indian Society of Remote Sensing >A Density-Based Clustering Method for the Segmentation of Individual Buildings from Filtered Airborne LiDAR Point Clouds
【24h】

A Density-Based Clustering Method for the Segmentation of Individual Buildings from Filtered Airborne LiDAR Point Clouds

机译:一种基于密度的聚类方法,用于从过滤的空中激光脉云分割各个建筑物

获取原文
获取原文并翻译 | 示例
           

摘要

Individual building segmentation is a prerequisite for building reconstruction. When building points or building regions are classified from raw LiDAR (Light Detection and Ranging) point clouds, the dataset usually contains numerous individual buildings as well as outliers. However, the applications to segment individual buildings from large datasets require the algorithms working with the minimal requirements of domain knowledge to determine the input parameters, working well on datasets with outliers and having good efficiency on big data. To meet these requirements, this paper presents a new segmentation method relying on a density-based clustering technique that is designed to separate individual buildings in dense built-up areas and is robust to outliers. As implemented in a spatial database, the algorithm benefits from the spatial index and the parallel computation capability offered by the system. The experimental results show that the proposed method is significantly more effective in segmenting individual buildings than the well-known moving window algorithm and the new boundary identification and tracing algorithm, and processes large volumes of data with good efficiency. Compared with the moving window algorithm, the proposed method (parallelized) consumed only 17.8% time and the quality improved from 88.8 to 94.8% on the Vaihingen dataset.
机译:个人建筑细分是建立重建的先决条件。当构建点或建筑物区域从原始LIDAR(光检测和测距)点云分类时,数据集通常包含许多单独的建筑物以及异常值。但是,从大型数据集分割各个建筑物的应用程序需要算法与域知识的最小要求,以确定输入参数,在具有异常值的数据集上运行良好,并在大数据上具有良好的效率。为满足这些要求,本文提出了一种依赖于基于密度的聚类技术的新分段方法,该技术旨在将各个建筑物分离在密集的内置区域中,并且对异常值具有坚固的稳健性。如在空间数据库中实现,算法从空间索引和系统提供的并行计算能力中受益。实验结果表明,该方法在分割各个建筑物中明显更有效地比众所周知的移动窗口算法和新的边界识别和跟踪算法,以及利用良好的效率处理大量数据。与移动窗口算法相比,所提出的方法(并行化)仅消耗17.8%的时间,并且质量在Vaihingen数据集中的88.8%提高到94.8%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号