首页> 外文期刊>Remote Sensing >Higher-Order Conditional Random Fields-Based 3D Semantic Labeling of Airborne Laser-Scanning Point Clouds
【24h】

Higher-Order Conditional Random Fields-Based 3D Semantic Labeling of Airborne Laser-Scanning Point Clouds

机译:基于高阶条件随机场的机载激光扫描点云3D语义标记

获取原文
           

摘要

This paper presents a novel framework to achieve 3D semantic labeling of objects (e.g., trees, buildings, and vehicles) from airborne laser-scanning point clouds. To this end, we propose a framework which consists of hierarchical clustering and higher-order conditional random fields (CRF) labeling. In the hierarchical clustering, the raw point clouds are over-segmented into a set of fine-grained clusters by integrating the point density clustering and the classic K-means clustering algorithm, followed by the proposed probability density clustering algorithm. Through this process, we not only obtain a more uniform size and more homogeneous clusters with semantic consistency, but the topological relationships of the cluster’s neighborhood are implicitly maintained by turning the problem of topology maintenance into a clustering problem based on the proposed probability density clustering algorithm. Subsequently, the fine-grained clusters and their topological context are fed into the CRF labeling step, from which the fine-grained cluster’s semantic labels are learned and determined by solving a multi-label energy minimization formulation, which simultaneously considers the unary, pairwise, and higher-order potentials. Our experiments of classifying urban and residential scenes demonstrate that the proposed approach reaches 88.5% and 86.1% of “m F 1 ” estimated by averaging all classes of the F 1 -scores. We prove that the proposed method outperforms five other state-of-the-art methods. In addition, we demonstrate the effectiveness of the proposed energy terms by using an “ablation study” strategy.
机译:本文提出了一种新颖的框架,可以从机载激光扫描点云中实现对象(例如树木,建筑物和车辆)的3D语义标记。为此,我们提出了一个由层次聚类和高阶条件随机字段(CRF)标记组成的框架。在分层聚类中,通过将点密度聚类和经典的K-means聚类算法相结合,然后再提出概率密度聚类算法,将原始点云过度细分为一组细粒度的聚类。通过这一过程,我们不仅获得了大小更均匀,语义一致性更均一的聚类,而且通过基于建议的概率密度聚类算法将拓扑维护问题转化为聚类问题,隐式地维护了聚类邻居的拓扑关系。 。随后,将细粒度簇及其拓扑上下文输入CRF标记步骤,从中学习并通过求解多标签能量最小化公式确定细粒度簇的语义标签,该方法同时考虑了一元,成对,和更高阶的潜力我们对城市和住宅场景进行分类的实验表明,通过对所有类别的F 1分数求平均值,所提出的方法可达到“ m F 1”的88.5%和86.1%。我们证明了所提出的方法优于其他五种最先进的方法。此外,我们通过“消融研究”策略论证了提出的能量项的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号