CVRODec 18, 2021

Fast and Robust Registration of Partially Overlapping Point Clouds

arXiv:2112.09922v174 citationsHas Code
Originality Incremental advance
AI Analysis

This addresses the challenge of fast and robust point cloud registration for autonomous systems, offering incremental improvements in speed and low-overlap performance.

The paper tackles the problem of real-time registration of partially overlapping point clouds with high relative translations, common in autonomous vehicles and multi-agent SLAM, by proposing a novel method that uses a point-wise feature encoder and graph-based attention network. It achieves on-par performance on KITTI, outperforms existing methods for low-overlap cases, and reduces inference times to as low as 410ms, up to 35 times faster than competitors.

Real-time registration of partially overlapping point clouds has emerging applications in cooperative perception for autonomous vehicles and multi-agent SLAM. The relative translation between point clouds in these applications is higher than in traditional SLAM and odometry applications, which challenges the identification of correspondences and a successful registration. In this paper, we propose a novel registration method for partially overlapping point clouds where correspondences are learned using an efficient point-wise feature encoder, and refined using a graph-based attention network. This attention network exploits geometrical relationships between key points to improve the matching in point clouds with low overlap. At inference time, the relative pose transformation is obtained by robustly fitting the correspondences through sample consensus. The evaluation is performed on the KITTI dataset and a novel synthetic dataset including low-overlapping point clouds with displacements of up to 30m. The proposed method achieves on-par performance with state-of-the-art methods on the KITTI dataset, and outperforms existing methods for low overlapping point clouds. Additionally, the proposed method achieves significantly faster inference times, as low as 410ms, between 5 and 35 times faster than competing methods. Our code and dataset are available at https://github.com/eduardohenriquearnold/fastreg.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes