Command Palette
Search for a command to run...
Challenging the Universal Representation of Deep Models for 3D Point Cloud Registration
David Bojanić Kristijan Bartol Josep Forest Stefan Gumhold Tomislav Petković Tomislav Pribanić

Abstract
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.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| point-cloud-registration-on-eth-trained-on | Greedy Grid Search | Feature Matching Recall: 0.784 |
| point-cloud-registration-on-fpv1 | Greedy Grid Search | RRE (degrees): 0.014 RTE (cm): 0.009 Recall (3cm, 10 degrees): 92.81 |
| point-cloud-registration-on-kitti-trained-on | Greedy Grid Search | Success Rate: 90.27 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.