Target-less registration of point clouds: A review

• URL: http://arxiv.org/abs/1912.12756v1
• Date: Sun, 29 Dec 2019 23:12:33 GMT
• Title: Target-less registration of point clouds: A review
• Authors: Yue Pan
• Abstract summary: We summarized the basic workflow of point cloud registration, namely correspondence determination and transformation estimation. We reviewed three commonly used groups of registration approaches, namely the feature matching based methods, the iterative closest points algorithm and the randomly hypothesis and verify based methods. At last, we discussed the challenges of current point cloud registration methods and proposed several open questions for the future development of automatic registration approaches.
• Score: 4.307704177248648
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Point cloud registration has been one of the basic steps of point cloud processing, which has a lot of applications in remote sensing and robotics. In this report, we summarized the basic workflow of target-less point cloud registration,namely correspondence determination and transformation estimation. Then we reviewed three commonly used groups of registration approaches, namely the feature matching based methods, the iterative closest points algorithm and the randomly hypothesis and verify based methods. Besides, we analyzed the advantage and disadvantage of these methods are introduced their common application scenarios. At last, we discussed the challenges of current point cloud registration methods and proposed several open questions for the future development of automatic registration approaches.

Related papers

• Fully-Geometric Cross-Attention for Point Cloud Registration [51.865371511201765]
  Point cloud registration approaches often fail when the overlap between point clouds is low due to noisy point correspondences. This work introduces a novel cross-attention mechanism tailored for Transformer-based architectures that tackles this problem. We integrate the Gromov-Wasserstein distance into the cross-attention formulation to jointly compute distances between points across different point clouds. At the point level, we also devise a self-attention mechanism that aggregates the local geometric structure information into point features for fine matching.
  arXiv  Detail & Related papers  (2025-02-12T10:44:36Z)
• Inferring Neural Signed Distance Functions by Overfitting on Single Noisy Point Clouds through Finetuning Data-Driven based Priors [53.6277160912059]
  We propose a method to promote pros of data-driven based and overfitting-based methods for better generalization, faster inference, and higher accuracy in learning neural SDFs. We introduce a novel statistical reasoning algorithm in local regions which is able to finetune data-driven based priors without signed distance supervision, clean point cloud, or point normals.
  arXiv  Detail & Related papers  (2024-10-25T16:48:44Z)
• Deep Learning-Based Point Cloud Registration: A Comprehensive Survey and Taxonomy [79.66031973540946]
  We present a comprehensive survey and taxonomy on deep learning-based point cloud registration (DL-PCR) For supervised DL-PCR methods, we organize the discussion based on key aspects, including the registration procedure. We classify them into correspondence-based and correspondence-free approaches, depending on whether they require explicit identification of point-to-point correspondences.
  arXiv  Detail & Related papers  (2024-04-22T02:05:15Z)
• PointCLM: A Contrastive Learning-based Framework for Multi-instance Point Cloud Registration [4.969636478156443]
  PointCLM is a contrastive learning-based framework for mutli-instance point cloud registration. Our method outperforms the state-of-the-art methods on both synthetic and real datasets by a large margin.
  arXiv  Detail & Related papers  (2022-09-01T04:30:05Z)
• PCRP: Unsupervised Point Cloud Object Retrieval and Pose Estimation [50.3020332934185]
  An unsupervised point cloud object retrieval and pose estimation method, called PCRP, is proposed in this work. Experiments on the ModelNet40 dataset demonstrate the superior performance of PCRP in comparison with traditional and learning based methods.
  arXiv  Detail & Related papers  (2022-02-16T03:37:43Z)
• Fast and Robust Registration of Partially Overlapping Point Clouds [5.073765501263891]
  Real-time registration of partially overlapping point clouds has emerging applications in cooperative perception for autonomous vehicles. Relative translation between point clouds in these applications is higher than in traditional SLAM and odometry applications. We propose a novel registration method for partially overlapping point clouds where correspondences are learned using an efficient point-wise feature encoder.
  arXiv  Detail & Related papers  (2021-12-18T12:39:05Z)
• Consistent Two-Flow Network for Tele-Registration of Point Clouds [74.51029406361997]
  We present a learning-based technique that allows registration between point clouds, presented in arbitrary poses, and having little or even no overlap. Our technique is based on a novel neural network design that learns a prior of a class of shapes and can complete a partial shape. We show that, compared with each separate flow, this two-flow training leads to robust and reliable tele-registration.
  arXiv  Detail & Related papers  (2021-06-01T09:03:21Z)
• End-to-End 3D Point Cloud Learning for Registration Task Using Virtual Correspondences [17.70819292121181]
  3D Point cloud registration is still a very challenging topic due to the difficulty in finding the rigid transformation between two point clouds. In this paper, we present an end-to-end deep-learning based approach to resolve the point cloud registration problem.
  arXiv  Detail & Related papers  (2020-11-30T06:55:05Z)
• DeepCLR: Correspondence-Less Architecture for Deep End-to-End Point Cloud Registration [12.471564670462344]
  This work addresses the problem of point cloud registration using deep neural networks. We propose an approach to predict the alignment between two point clouds with overlapping data content, but displaced origins. Our approach achieves state-of-the-art accuracy and the lowest run-time of the compared methods.
  arXiv  Detail & Related papers  (2020-07-22T08:20:57Z)
• Learning multiview 3D point cloud registration [74.39499501822682]
  We present a novel, end-to-end learnable, multiview 3D point cloud registration algorithm. Our approach outperforms the state-of-the-art by a significant margin, while being end-to-end trainable and computationally less costly.
  arXiv  Detail & Related papers  (2020-01-15T03:42:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.