Challenging the Universal Representation of Deep Models for 3D Point Cloud Registration

Learning universal representations across different applications domain is an open research problem. In fact, finding universal architecture within the same application but across different types of datasets is still unsolved problem too, especially in applications involving processing 3D point clouds. In this work we experimentally test several state-of-the-art learning-based methods for 3D point cloud registration against the proposed non-learning baseline registration method. The proposed method either outperforms or achieves comparable results w.r.t. learning based methods. In addition, we propose a dataset on which learning based methods have a hard time to generalize. Our proposed method and dataset, along with the provided experiments, can be used in further research in studying effective solutions for universal representations. Our source code is available at: github.com/DavidBoja/greedy-grid-search.

PDF Abstract

Datasets


Introduced in the Paper:

FPv1

Used in the Paper:

KITTI 3DMatch ETH

Results from the Paper


Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Point Cloud Registration ETH (trained on 3DMatch) Greedy Grid Search Feature Matching Recall 0.784 # 5
Point Cloud Registration FPv1 Greedy Grid Search Recall (3cm, 10 degrees) 92.81 # 1
RRE (degrees) 0.014 # 8
RTE (cm) 0.009 # 8
Point Cloud Registration KITTI (trained on 3DMatch) Greedy Grid Search Success Rate 90.27 # 7

Methods