RPM-Net: Robust Point Matching using Learned Features

• URL: http://arxiv.org/abs/2003.13479v1
• Date: Mon, 30 Mar 2020 13:45:27 GMT
• Title: RPM-Net: Robust Point Matching using Learned Features
• Authors: Zi Jian Yew and Gim Hee Lee
• Abstract summary: 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.
• Score: 79.52112840465558
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Iterative Closest Point (ICP) solves the rigid point cloud registration problem iteratively in two steps: (1) make hard assignments of spatially closest point correspondences, and then (2) find the least-squares rigid transformation. The hard assignments of closest point correspondences based on spatial distances are sensitive to the initial rigid transformation and noisy/outlier points, which often cause ICP to converge to wrong local minima. In this paper, we propose the RPM-Net -- a less sensitive to initialization and more robust deep learning-based approach for rigid point cloud registration. To this end, our network uses the differentiable Sinkhorn layer and annealing to get soft assignments of point correspondences from hybrid features learned from both spatial coordinates and local geometry. To further improve registration performance, we introduce a secondary network to predict optimal annealing parameters. Unlike some existing methods, our RPM-Net handles missing correspondences and point clouds with partial visibility. Experimental results show that our RPM-Net achieves state-of-the-art performance compared to existing non-deep learning and recent deep learning methods. Our source code is available at the project website https://github.com/yewzijian/RPMNet .

Related papers

• DIPR: Efficient Point Cloud Registration via Dynamic Iteration [4.491867613612359]
  We introduce a novel Efficient Point Cloud Registration via Dynamic It framework, DIPR, that makes the neural network interactively focus on overlapping points based on sparser input points. Our proposed approach achieves superior registration accuracy while significantly reducing computational time and GPU memory consumption compared to state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-12-05T16:47:46Z)
• 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)
• Robust Point Cloud Registration Framework Based on Deep Graph Matching(TPAMI Version) [13.286247750893681]
  3D point cloud registration is a fundamental problem in computer vision and robotics. We propose a novel deep graph matching-based framework for point cloud registration.
  arXiv  Detail & Related papers  (2022-11-09T06:05:25Z)
• CAP-UDF: Learning Unsigned Distance Functions Progressively from Raw Point Clouds with Consistency-Aware Field Optimization [54.69408516025872]
  CAP-UDF is a novel method to learn consistency-aware UDF from raw point clouds. We train a neural network to gradually infer the relationship between queries and the approximated surface. We also introduce a polygonization algorithm to extract surfaces using the gradients of the learned UDF.
  arXiv  Detail & Related papers  (2022-10-06T08:51:08Z)
• 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)
• PCAM: Product of Cross-Attention Matrices for Rigid Registration of Point Clouds [79.99653758293277]
  PCAM is a neural network whose key element is a pointwise product of cross-attention matrices. We show that PCAM achieves state-of-the-art results among methods which, like us, solve steps (a) and (b) jointly via deepnets.
  arXiv  Detail & Related papers  (2021-10-04T09:23:27Z)
• PointDSC: Robust Point Cloud Registration using Deep Spatial Consistency [38.93610732090426]
  We present PointDSC, a novel deep neural network that explicitly incorporates spatial consistency for pruning outlier correspondences. Our method outperforms the state-of-the-art hand-crafted and learning-based outlier rejection approaches on several real-world datasets.
  arXiv  Detail & Related papers  (2021-03-09T14:56:08Z)
• Robust Point Cloud Registration Framework Based on Deep Graph Matching [5.865029600972316]
  3D point cloud registration is a fundamental problem in computer vision and robotics. We propose a novel deep graph matchingbased framework for point cloud registration.
  arXiv  Detail & Related papers  (2021-03-07T04:20:29Z)
• PRIN/SPRIN: On Extracting Point-wise Rotation Invariant Features [91.2054994193218]
  We propose a point-set learning framework PRIN, focusing on rotation invariant feature extraction in point clouds analysis. In addition, we extend PRIN to a sparse version called SPRIN, which directly operates on sparse point clouds. Results show that, on the dataset with randomly rotated point clouds, SPRIN demonstrates better performance than state-of-the-art methods without any data augmentation.
  arXiv  Detail & Related papers  (2021-02-24T06:44:09Z)

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.