Best Buddies Registration for Point Clouds

• URL: http://arxiv.org/abs/2010.01912v1
• Date: Mon, 5 Oct 2020 10:49:18 GMT
• Title: Best Buddies Registration for Point Clouds
• Authors: Amnon Drory, Tal Shomer, Shai Avidan and Raja Giryes
• Abstract summary: Loss functions are inspired by the Best Buddies Similarity measure that counts the number of mutual nearest neighbors between two point sets. We present several algorithms, collectively named Best Buddy Registration (BBR), where each algorithm consists of optimizing one of these loss functions with Adam gradient descent. Experiments on various data sets, both synthetic and real, demonstrate the effectiveness of the BBR algorithms.
• Score: 46.48442376651696
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose new, and robust, loss functions for the point cloud registration problem. Our loss functions are inspired by the Best Buddies Similarity (BBS) measure that counts the number of mutual nearest neighbors between two point sets. This measure has been shown to be robust to outliers and missing data in the case of template matching for images. We present several algorithms, collectively named Best Buddy Registration (BBR), where each algorithm consists of optimizing one of these loss functions with Adam gradient descent. The loss functions differ in several ways, including the distance function used (point-to-point vs. point-to-plane), and how the BBS measure is combined with the actual distances between pairs of points. Experiments on various data sets, both synthetic and real, demonstrate the effectiveness of the BBR algorithms, showing that they are quite robust to noise, outliers, and distractors, and cope well with extremely sparse point clouds. One variant, BBR-F, achieves state-of-the-art accuracy in the registration of automotive lidar scans taken up to several seconds apart, from the KITTI and Apollo-Southbay datasets.

Related papers

• 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)
• Multiway Point Cloud Mosaicking with Diffusion and Global Optimization [74.3802812773891]
  We introduce a novel framework for multiway point cloud mosaicking (named Wednesday) At the core of our approach is ODIN, a learned pairwise registration algorithm that identifies overlaps and refines attention scores. Tested on four diverse, large-scale datasets, our method state-of-the-art pairwise and rotation registration results by a large margin on all benchmarks.
  arXiv  Detail & Related papers  (2024-03-30T17:29:13Z)
• GraphAlign: Enhancing Accurate Feature Alignment by Graph matching for Multi-Modal 3D Object Detection [7.743525134435137]
  LiDAR and cameras are complementary sensors for 3D object detection in autonomous driving. We present GraphAlign, a more accurate feature alignment strategy for 3D object detection by graph matching.
  arXiv  Detail & Related papers  (2023-10-12T12:06:31Z)
• Overlap Bias Matching is Necessary for Point Cloud Registration [21.584033532099134]
  Overlap between point clouds to be registered may be relatively small. We propose an unsupervised network Overlap Bias Matching Network (OBMNet) for partial point cloud registration.
  arXiv  Detail & Related papers  (2023-08-18T07:47:22Z)
• Overlap-guided Gaussian Mixture Models for Point Cloud Registration [61.250516170418784]
  Probabilistic 3D point cloud registration methods have shown competitive performance in overcoming noise, outliers, and density variations. This paper proposes a novel overlap-guided probabilistic registration approach that computes the optimal transformation from matched Gaussian Mixture Model (GMM) parameters.
  arXiv  Detail & Related papers  (2022-10-17T08:02:33Z)
• Learning to Register Unbalanced Point Pairs [10.369750912567714]
  Recent 3D registration methods can effectively handle large-scale or partially overlapping point pairs. We present a novel 3D registration method, called UPPNet, for the unbalanced point pairs.
  arXiv  Detail & Related papers  (2022-07-09T08:03:59Z)
• Learning Dense Features for Point Cloud Registration Using Graph Attention Network [0.0]
  We introduce a framework that efficiently and economically extracts dense features using graph attention network for point cloud matching and registration. The detector of the DFGAT is responsible for finding highly reliable key points in large raw data sets. The graph attention network uses the attention mechanism that enriches the relationships between point clouds.
  arXiv  Detail & Related papers  (2022-06-14T10:28:57Z)
• DeepBBS: Deep Best Buddies for Point Cloud Registration [55.12101890792121]
  DeepBBS is a novel method for learning a representation that takes into account the best buddy distance between points during training. Our experiments show improved performance compared to previous methods.
  arXiv  Detail & Related papers  (2021-10-06T19:00:07Z)
• RPM-Net: Robust Point Matching using Learned Features [79.52112840465558]
  RPM-Net is a less sensitive and more robust deep learning-based approach for rigid point cloud registration. Unlike some existing methods, our RPM-Net handles missing correspondences and point clouds with partial visibility.
  arXiv  Detail & Related papers  (2020-03-30T13:45:27Z)

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.