CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration

• URL: http://arxiv.org/abs/2110.14076v1
• Date: Tue, 26 Oct 2021 23:05:00 GMT
• Title: CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration
• Authors: Hao Yu, Fu Li, Mahdi Saleh, Benjamin Busam, Slobodan Ilic
• Abstract summary: 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.
• Score: 35.57761839361479
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the problem of extracting correspondences between a pair of point clouds for registration. For correspondence retrieval, existing works benefit from matching sparse keypoints detected from dense points but usually struggle to guarantee their repeatability. To address this issue, we present CoFiNet - Coarse-to-Fine Network which extracts hierarchical correspondences from coarse to fine without keypoint detection. On a coarse scale and guided by a weighting scheme, our model firstly learns to match down-sampled nodes whose vicinity points share more overlap, which significantly shrinks the search space of a consecutive stage. On a finer scale, node proposals are consecutively expanded to patches that consist of groups of points together with associated descriptors. Point correspondences are then refined from the overlap areas of corresponding patches, by a density-adaptive matching module capable to deal with varying point density. Extensive evaluation of CoFiNet on both indoor and outdoor standard benchmarks shows our superiority over existing methods. Especially on 3DLoMatch where point clouds share less overlap, CoFiNet significantly outperforms state-of-the-art approaches by at least 5% on Registration Recall, with at most two-third of their parameters.

Related papers

• 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)
• FreePoint: Unsupervised Point Cloud Instance Segmentation [72.64540130803687]
  We propose FreePoint, for underexplored unsupervised class-agnostic instance segmentation on point clouds. We represent point features by combining coordinates, colors, and self-supervised deep features. Based on the point features, we segment point clouds into coarse instance masks as pseudo labels, which are used to train a point cloud instance segmentation model.
  arXiv  Detail & Related papers  (2023-05-11T16:56:26Z)
• HybridPoint: Point Cloud Registration Based on Hybrid Point Sampling and Matching [8.255850058549653]
  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.
  arXiv  Detail & Related papers  (2023-03-29T08:28:45Z)
• 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)
• Reliability-Adaptive Consistency Regularization for Weakly-Supervised Point Cloud Segmentation [80.07161039753043]
  Weakly-supervised point cloud segmentation with extremely limited labels is desirable to alleviate the expensive costs of collecting densely annotated 3D points. This paper explores applying the consistency regularization that is commonly used in weakly-supervised learning, for its point cloud counterpart with multiple data-specific augmentations. We propose a novel Reliability-Adaptive Consistency Network (RAC-Net) to use both prediction confidence and model uncertainty to measure the reliability of pseudo labels.
  arXiv  Detail & Related papers  (2023-03-09T10:41:57Z)
• 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 Semantic Segmentation of Large-Scale Point Clouds with Random Sampling [52.464516118826765]
  We introduce RandLA-Net, an efficient and lightweight neural architecture to infer per-point semantics for large-scale point clouds. The key to our approach is to use random point sampling instead of more complex point selection approaches. Our RandLA-Net can process 1 million points in a single pass up to 200x faster than existing approaches.
  arXiv  Detail & Related papers  (2021-07-06T05:08:34Z)
• 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.