HyperAIHyperAI

Command Palette

Search for a command to run...

3 months ago

Addressing the generalization of 3D registration methods with a featureless baseline and an unbiased benchmark

{Tomislav Tomislav; Pribanić Josep; Petković Kristijan; Forest David; Bartol Bojanić}

Abstract

Recent 3D registration methods are mostly learning-based that either find correspondences in feature space and match them, or directly estimate the registration transformation from the given point cloud features. Therefore, these feature-based methods have difficulties with generalizing onto point clouds that differ substantially from their training data. This issue is not so apparent because of the problematic benchmark definitions that cannot provide any in-depth analysis and contain a bias toward similar data. Therefore, we propose a methodology to create a 3D registration benchmark, given a point cloud dataset, that provides a more informative evaluation of a method w.r.t. other benchmarks. Using this methodology, we create a novel FAUST-partial (FP) benchmark, based on the FAUST dataset, with several difficulty levels. The FP benchmark addresses the limitations of the current benchmarks: lack of data and parameter range variability, and allows to evaluate the strengths and weaknesses of a 3D registration method w.r.t. a single registration parameter. Using the new FP benchmark, we provide a thorough analysis of the current state-of-the-art methods and observe that the current method still struggle to generalize onto severely different out-of-sample data. Therefore, we propose a simple featureless traditional 3D registration baseline method based on the weighted cross-correlation between two given point clouds. Our method achieves strong results on current benchmarking datasets, outperforming most deep learning methods. Our source code is available on github.com/DavidBoja/exhaustive-grid-search.

Benchmarks

BenchmarkMethodologyMetrics
point-cloud-registration-on-3dmatch-at-least-1Exhaustive Grid Search
Recall (0.3m, 15 degrees): 84.11
point-cloud-registration-on-eth-trained-onExhaustive Grid Search
Recall (30cm, 5 degrees): 94.25
point-cloud-registration-on-fp-o-eExhaustive Grid Search
RRE (degrees): 0.067
RTE (cm): 0.035
Recall (3cm, 10 degrees): 99.47
point-cloud-registration-on-fp-o-hExhaustive Grid Search
RRE (degrees): 0.477
RTE (cm): 0.234
Recall (3cm, 10 degrees): 37.06
point-cloud-registration-on-fp-o-mExhaustive Grid Search
RRE (degrees): 0.030
RTE (cm): 0.017
Recall (3cm, 10 degrees): 88.06
point-cloud-registration-on-fp-r-eExhaustive Grid Search
RRE (degrees): 0.005
RTE (cm): 0.002
Recall (3cm, 10 degrees): 99.64
point-cloud-registration-on-fp-r-hExhaustive Grid Search
RRE (degrees): 0.01
RTE (cm): 0.007
Recall (3cm, 10 degrees): 78.00
point-cloud-registration-on-fp-r-mExhaustive Grid Search
RRE (degrees): 0.003
RTE (cm): 0.003
Recall (3cm, 10 degrees): 97.92
point-cloud-registration-on-fp-t-eExhaustive Grid Search
RRE (degrees): 0.005
RTE (cm): 0.002
Recall (3cm, 10 degrees): 99.70
point-cloud-registration-on-fp-t-hExhaustive Grid Search
RRE (degrees): 0.005
RTE (cm): 0.002
Recall (3cm, 10 degrees): 98.81
point-cloud-registration-on-fp-t-mExhaustive Grid Search
RRE (degrees): 0.005
RTE (cm): 0.002
Recall (3cm, 10 degrees): 99.82
point-cloud-registration-on-kitti-fcgfExhaustive Grid Search
Recall (0.6m, 5 degrees): 94.59
point-cloud-registration-on-kitti-trained-onExhaustive Grid Search
Success Rate: 94.95

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.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
Addressing the generalization of 3D registration methods with a featureless baseline and an unbiased benchmark | Papers | HyperAI