HybridPoint: Point Cloud Registration Based on Hybrid Point Sampling and Matching

• URL: http://arxiv.org/abs/2303.16526v2
• Date: Sun, 23 Apr 2023 14:21:02 GMT
• Title: HybridPoint: Point Cloud Registration Based on Hybrid Point Sampling and Matching
• Authors: Yiheng Li, Canhui Tang, Runzhao Yao, Aixue Ye, Feng Wen and Shaoyi Du
• Abstract summary: We propose a HybridPoint-based network to find more robust and accurate correspondences. Our model achieves state-of-the-art performance on 3DMatch, 3DLoMatch, and KITTI odometry.
• Score: 8.255850058549653
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Patch-to-point matching has become a robust way of point cloud registration. However, previous patch-matching methods employ superpoints with poor localization precision as nodes, which may lead to ambiguous patch partitions. In this paper, we propose a HybridPoint-based network to find more robust and accurate correspondences. Firstly, we propose to use salient points with prominent local features as nodes to increase patch repeatability, and introduce some uniformly distributed points to complete the point cloud, thus constituting hybrid points. Hybrid points not only have better localization precision but also give a complete picture of the whole point cloud. Furthermore, based on the characteristic of hybrid points, we propose a dual-classes patch matching module, which leverages the matching results of salient points and filters the matching noise of non-salient points. Experiments show that our model achieves state-of-the-art performance on 3DMatch, 3DLoMatch, and KITTI odometry, especially with 93.0% Registration Recall on the 3DMatch dataset. Our code and models are available at https://github.com/liyih/HybridPoint.

Related papers

• Zero-Shot Point Cloud Registration [94.39796531154303]
  ZeroReg is the first zero-shot point cloud registration approach that eliminates the need for training on point cloud datasets. The cornerstone of ZeroReg is the novel transfer of image features from keypoints to the point cloud, enriched by aggregating information from 3D geometric neighborhoods. On benchmarks such as 3DMatch, 3DLoMatch, and ScanNet, ZeroReg achieves impressive Recall Ratios (RR) of over 84%, 46%, and 75%, respectively.
  arXiv  Detail & Related papers  (2023-12-05T11:33:16Z)
• A Strong Baseline for Point Cloud Registration via Direct Superpoints Matching [7.308509114539376]
  We propose a simple and effective baseline to find correspondences of superpoints in a global matching manner. Our simple yet effective baseline shows comparable or even better results than state-of-the-art methods on three datasets.
  arXiv  Detail & Related papers  (2023-07-03T21:33:40Z)
• Unsupervised Deep Probabilistic Approach for Partial Point Cloud Registration [74.53755415380171]
  Deep point cloud registration methods face challenges to partial overlaps and rely on labeled data. We propose UDPReg, an unsupervised deep probabilistic registration framework for point clouds with partial overlaps. Our UDPReg achieves competitive performance on the 3DMatch/3DLoMatch and ModelNet/ModelLoNet benchmarks.
  arXiv  Detail & Related papers  (2023-03-23T14:18:06Z)
• PointPatchMix: Point Cloud Mixing with Patch Scoring [58.58535918705736]
  We propose PointPatchMix, which mixes point clouds at the patch level and generates content-based targets for mixed point clouds. Our approach preserves local features at the patch level, while the patch scoring module assigns targets based on the content-based significance score from a pre-trained teacher model. With Point-MAE as our baseline, our model surpasses previous methods by a significant margin, achieving 86.3% accuracy on ScanObjectNN and 94.1% accuracy on ModelNet40.
  arXiv  Detail & Related papers  (2023-03-12T14:49:42Z)
• 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)
• Geometric Transformer for Fast and Robust Point Cloud Registration [53.10568889775553]
  We study the problem of extracting accurate correspondences for point cloud registration. Recent keypoint-free methods bypass the detection of repeatable keypoints which is difficult in low-overlap scenarios. We propose Geometric Transformer to learn geometric feature for robust superpoint matching.
  arXiv  Detail & Related papers  (2022-02-14T13:26:09Z)
• CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration [35.57761839361479]
  CoFiNet - Coarse-to-Fine Network - extracts hierarchical correspondences from coarse to fine without keypoint detection. Our model learns to match down-sampled nodes whose vicinity points share more overlap. Point correspondences are then refined from the overlap areas of corresponding patches, by a density-adaptive matching module.
  arXiv  Detail & Related papers  (2021-10-26T23:05:00Z)
• SnowflakeNet: Point Cloud Completion by Snowflake Point Deconvolution with Skip-Transformer [54.45987960347304]
  We propose SnowflakeNet with Snowflake Point Deconvolution (SPD) to generate the complete point clouds. SPD learns point splitting patterns which can fit local regions the best. Our experimental results outperform the state-of-the-art point cloud completion methods under widely used benchmarks.
  arXiv  Detail & Related papers  (2021-08-10T04:33:37Z)
• PointCutMix: Regularization Strategy for Point Cloud Classification [7.6904253666422395]
  We propose a simple and effective augmentation method for the point cloud data, named PointCutMix. It finds the optimal assignment between two point clouds and generates new training data by replacing the points in one sample with their optimal assigned pairs.
  arXiv  Detail & Related papers  (2021-01-05T11:39:06Z)
• 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.