R-PointHop: A Green, Accurate and Unsupervised Point Cloud Registration Method

• URL: http://arxiv.org/abs/2103.08129v1
• Date: Mon, 15 Mar 2021 04:12:44 GMT
• Title: R-PointHop: A Green, Accurate and Unsupervised Point Cloud Registration Method
• Authors: Pranav Kadam, Min Zhang, Shan Liu, C.-C. Jay Kuo
• Abstract summary: An unsupervised 3D point cloud registration method, called R-PointHop, is proposed in this work. Experiments are conducted on the ModelNet40 and the Stanford Bunny dataset, which demonstrate the effectiveness of R-PointHop on the 3D point cloud registration task.
• Score: 64.86292006892093
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Inspired by the recent PointHop classification method, an unsupervised 3D point cloud registration method, called R-PointHop, is proposed in this work. R-PointHop first determines a local reference frame (LRF) for every point using its nearest neighbors and finds its local attributes. Next, R-PointHop obtains local-to-global hierarchical features by point downsampling, neighborhood expansion, attribute construction and dimensionality reduction steps. Thus, we can build the correspondence of points in the hierarchical feature space using the nearest neighbor rule. Afterwards, a subset of salient points of good correspondence is selected to estimate the 3D transformation. The use of LRF allows for hierarchical features of points to be invariant with respect to rotation and translation, thus making R-PointHop more robust in building point correspondence even when rotation angles are large. Experiments are conducted on the ModelNet40 and the Stanford Bunny dataset, which demonstrate the effectiveness of R-PointHop on the 3D point cloud registration task. R-PointHop is a green and accurate solution since its model size and training time are smaller than those of deep learning methods by an order of magnitude while its registration errors are smaller. Our codes are available on GitHub.

Related papers

• 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)
• PointFlowHop: Green and Interpretable Scene Flow Estimation from Consecutive Point Clouds [49.7285297470392]
  An efficient 3D scene flow estimation method called PointFlowHop is proposed in this work. PointFlowHop takes two consecutive point clouds and determines the 3D flow vectors for every point in the first point cloud. It decomposes the scene flow estimation task into a set of subtasks, including ego-motion compensation, object association and object-wise motion estimation.
  arXiv  Detail & Related papers  (2023-02-27T23:06:01Z)
• S3I-PointHop: SO(3)-Invariant PointHop for 3D Point Cloud Classification [49.16961132283838]
  This work focuses on a mathematically transparent point cloud classification method called PointHop. We analyze its reason for failure due to pose variations, and solve the problem by replacing its pose dependent modules with rotation invariant counterparts. Experiments on the ModelNet40 dataset demonstrate the superiority of S3I-PointHop over traditional PointHop-like methods.
  arXiv  Detail & Related papers  (2023-02-22T17:23:33Z)
• Object Detection in 3D Point Clouds via Local Correlation-Aware Point Embedding [0.0]
  We present an improved approach for 3D object detection in point cloud data based on the Frustum PointNet (F-PointNet) Compared to the original F-PointNet, our newly proposed method considers the point neighborhood when computing point features.
  arXiv  Detail & Related papers  (2023-01-11T18:14:47Z)
• UPDesc: Unsupervised Point Descriptor Learning for Robust Registration [54.95201961399334]
  UPDesc is an unsupervised method to learn point descriptors for robust point cloud registration. We show that our learned descriptors yield superior performance over existing unsupervised methods.
  arXiv  Detail & Related papers  (2021-08-05T17:11:08Z)
• Point Cloud Registration using Representative Overlapping Points [10.843159482657303]
  We propose ROPNet, a new deep learning model using Representative Overlapping Points with discriminative features for registration. Specifically, we propose a context-guided module which uses an encoder to extract global features for predicting point overlap score. Experiments over ModelNet40 using noisy and partially overlapping point clouds show that the proposed method outperforms traditional and learning-based methods.
  arXiv  Detail & Related papers  (2021-07-06T12:52:22Z)
• 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)
• PointHop++: A Lightweight Learning Model on Point Sets for 3D Classification [55.887502438160304]
  The PointHop method was recently proposed by Zhang et al. for 3D point cloud classification with unsupervised feature extraction. We improve the PointHop method furthermore in two aspects: 1) reducing its model complexity in terms of the model parameter number and 2) ordering discriminant features automatically based on the cross-entropy criterion. With experiments conducted on the ModelNet40 benchmark dataset, we show that the PointHop++ method performs on par with deep neural network (DNN) solutions and surpasses other unsupervised feature extraction methods.
  arXiv  Detail & Related papers  (2020-02-09T04:49:32Z)

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.