【24h】

Learning Multiview 3D Point Cloud Registration

机译:学习Multiview 3D点云注册

获取原文

摘要

We present a novel, end-to-end learnable, multiview 3D point cloud registration algorithm. Registration of multiple scans typically follows a two-stage pipeline: the initial pairwise alignment and the globally consistent refinement. The former is often ambiguous due to the low overlap of neighboring point clouds, symmetries and repetitive scene parts. Therefore, the latter global refinement aims at establishing the cyclic consistency across multiple scans and helps in resolving the ambiguous cases. In this paper we propose, to the best of our knowledge, the first end-to-end algorithm for joint learning of both parts of this two-stage problem. Experimental evaluation on well accepted benchmark datasets shows that our approach outperforms the state-of-the-art by a significant margin, while being end-to-end trainable and computationally less costly. Moreover, we present detailed analysis and an ablation study that validate the novel components of our approach. The source code and pretrained models are publicly available under https://github.com/zgojcic/3D_multiview_reg.
机译:我们提出了一种新颖的,端到端的可学习的,多视图3D点云注册算法。多次扫描的配准通常遵循两个阶段的流程:初始的成对对齐和全局一致的细化。前者通常由于相邻点云,对称性和重复的场景部分的重叠少而模棱两可。因此,后一种全局优化旨在建立跨多个扫描的循环一致性,并有助于解决模棱两可的情况。在本文中,我们就我们所知,提出了第一个端到端算法,用于联合学习这个两阶段问题的两个部分。对公认的基准数据集进行的实验评估表明,我们的方法明显优于最新技术,同时具有端到端的可训练性和较低的计算成本。此外,我们提出了详细的分析和消融研究,验证了我们方法的新颖性。源代码和经过预训练的模型可在https://github.com/zgojcic/3D_multiview_reg下公开获得。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号