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 3DMatch, 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.
翻译:受最近PointHop分类方法的启发,在此工作中建议采用名为 R-PointHop 的不受监督的 3D 点云登记方法。 R- PointHop 首先决定使用近邻的每个点的本地参考框架( LRF ), 并找到其本地属性 。 其次, R- PointHop 通过点下取样、 邻里扩张、 属性构建 和 维度 减少 步骤, 获得本地到全球的等级特征 。 因此, 我们可以使用最近的邻居规则, 建立等级空间的分级点的对应点 。 之后, 选择了一组好通信的突出点来估计 3D 转换 。 使用 LRF 允许在旋转和翻译方面各点的等级性特征, 从而使得 R- PointHop 在建设点通信时, 即使在旋转角度较大时, 也更加坚固。 在 3DMatch、 ModelNet40 和斯坦福邦特 数据集上进行实验, 这显示了 R- PointHop 在 3D点云登记任务上的有效性 。 R- PointHop 是一个绿色和准确的解决方案解决方案, 因为其模型大小和训练时间比我们深层的编码要小。