Deep Learning-Based Point Cloud Registration: A Comprehensive Survey and Taxonomy

• URL: http://arxiv.org/abs/2404.13830v3
• Date: Sun, 02 Feb 2025 04:32:17 GMT
• Title: Deep Learning-Based Point Cloud Registration: A Comprehensive Survey and Taxonomy
• Authors: Yu-Xin Zhang, Jie Gui, Baosheng Yu, Xiaofeng Cong, Xin Gong, Wenbing Tao, Dacheng Tao,
• Abstract summary: 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.
• Score: 79.66031973540946
• License:
• Abstract: Point cloud registration involves determining a rigid transformation to align a source point cloud with a target point cloud. This alignment is fundamental in applications such as autonomous driving, robotics, and medical imaging, where precise spatial correspondence is essential. Deep learning has greatly advanced point cloud registration by providing robust and efficient methods that address the limitations of traditional approaches, including sensitivity to noise, outliers, and initialization. However, a well-constructed taxonomy for these methods is still lacking, making it difficult to systematically classify and compare the various approaches. In this paper, we present a comprehensive survey and taxonomy on deep learning-based point cloud registration (DL-PCR). We begin with a formal description of the point cloud registration problem, followed by an overview of the datasets, evaluation metrics, and loss functions commonly used in DL-PCR. Next, we categorize existing DL-PCR methods into supervised and unsupervised approaches, as they focus on significantly different key aspects. For supervised DL-PCR methods, we organize the discussion based on key aspects, including the registration procedure, optimization strategy, learning paradigm, network enhancement, and integration with traditional methods; For unsupervised DL-PCR methods, we classify them into correspondence-based and correspondence-free approaches, depending on whether they require explicit identification of point-to-point correspondences. To facilitate a more comprehensive and fair comparison, we conduct quantitative evaluations of all recent state-of-the-art approaches, using a unified training setting and consistent data partitioning strategy. Lastly, we highlight the open challenges and discuss potential directions for future study. A comprehensive collection is available at https://github.com/yxzhang15/PCR.

Related papers

• Patch-Based Contrastive Learning and Memory Consolidation for Online Unsupervised Continual Learning [6.042269506496206]
  We focus on a relatively unexplored learning paradigm known as em Online Unsupervised Continual Learning (O-UCL) Unlike prior work in unsupervised, continual, or online learning, O-UCL combines all three areas into a single challenging and realistic learning paradigm. In this setting, agents are frequently evaluated and must aim to maintain the best possible representation at any point of the data stream, rather than at the end of pre-specified offline tasks.
  arXiv  Detail & Related papers  (2024-09-24T18:46:32Z)
• Provably Efficient UCB-type Algorithms For Learning Predictive State Representations [55.00359893021461]
  The sequential decision-making problem is statistically learnable if it admits a low-rank structure modeled by predictive state representations (PSRs) This paper proposes the first known UCB-type approach for PSRs, featuring a novel bonus term that upper bounds the total variation distance between the estimated and true models. In contrast to existing approaches for PSRs, our UCB-type algorithms enjoy computational tractability, last-iterate guaranteed near-optimal policy, and guaranteed model accuracy.
  arXiv  Detail & Related papers  (2023-07-01T18:35:21Z)
• A Survey of Label-Efficient Deep Learning for 3D Point Clouds [109.07889215814589]
  This paper presents the first comprehensive survey of label-efficient learning of point clouds. We propose a taxonomy that organizes label-efficient learning methods based on the data prerequisites provided by different types of labels. For each approach, we outline the problem setup and provide an extensive literature review that showcases relevant progress and challenges.
  arXiv  Detail & Related papers  (2023-05-31T12:54:51Z)
• Spatiotemporal Self-supervised Learning for Point Clouds in the Wild [65.56679416475943]
  We introduce an SSL strategy that leverages positive pairs in both the spatial and temporal domain. We demonstrate the benefits of our approach via extensive experiments performed by self-supervised training on two large-scale LiDAR datasets.
  arXiv  Detail & Related papers  (2023-03-28T18:06:22Z)
• Point Cloud Registration for LiDAR and Photogrammetric Data: a Critical Synthesis and Performance Analysis on Classic and Deep Learning Algorithms [7.874736360019618]
  We provide a comprehensive review of the state-of-the-art (SOTA) point cloud registration methods. We analyze and evaluate these methods using a diverse set of point cloud data from indoor to satellite sources. More than ten methods, including classic hand-crafted, deep-learning-based feature correspondence, and robust C2C methods were tested.
  arXiv  Detail & Related papers  (2023-02-14T16:52:26Z)
• 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)
• 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)
• Unsupervised Point Cloud Registration via Salient Points Analysis (SPA) [57.62713515497585]
  An unsupervised point cloud registration method, called salient points analysis (SPA), is proposed in this work. It first applies the PointHop++ method to point clouds, finds corresponding salient points in two point clouds based on the local surface characteristics of points and performs registration by matching the corresponding salient points. The effectiveness of the SPA method is demonstrated by experiments on seen and unseen classes and noisy point clouds from the ModelNet-40 dataset.
  arXiv  Detail & Related papers  (2020-09-02T18:40:37Z)
• Target-less registration of point clouds: A review [4.307704177248648]
  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.
  arXiv  Detail & Related papers  (2019-12-29T23:12:33Z)

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.