Fast Global Point Cloud Registration using Semantic NDT

Robust and accurate point cloud registration is an essential part of many robotic tasks such as SLAM or object pose retrieval. In this paper, we address the problem of global 3D point cloud registration, i.e., the task of estimating the 3D rigid body transform between a source and a target point cloud without any initial guess. Typically, the problem is solved by extracting and matching features to find a data association and then computing a transform that minimizes the squared distance between points. Our approach combines the normal distributions transform and oriented point pair framework and introduces the NDT distance histogram to quickly generate and test candidate transforms. Our method further exploits semantic information if available for greater speed. We implement our algorithm in C++ and compare it to other state-of-the-art approaches on a diverse set of environments. Our evaluation shows that our method outperforms the other approaches, especially concerning run-time and compute efficiency.

Authors

Institutions

Publication Details

Published
2024-10-14
DOI
https://doi.org/10.1109/iros58592.2024.10801863
Citations
1
Primary Topic
Remote Sensing and LiDAR Applications
Type
article
Field-Weighted Citation Impact
0.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fast Global Point Cloud Registration using Semantic NDT

Cyrill Stachniss, Narunas Vaškevičius, Robert Schirmer, Peter Biber
1 citations
Remote Sensing and LiDAR Applications
0.21
article

Fast Global Point Cloud Registration using Semantic NDT

Cyrill Stachniss, Narunas Vaškevičius, Robert Schirmer, Peter Biber
article en
1 citations

Abstract

Robust and accurate point cloud registration is an essential part of many robotic tasks such as SLAM or object pose retrieval. In this paper, we address the problem of global 3D point cloud registration, i.e., the task of estimating the 3D rigid body transform between a source and a target point cloud without any initial guess. Typically, the problem is solved by extracting and matching features to find a data association and then computing a transform that minimizes the squared distance between points. Our approach combines the normal distributions transform and oriented point pair framework and introduces the NDT distance histogram to quickly generate and test candidate transforms. Our method further exploits semantic information if available for greater speed. We implement our algorithm in C++ and compare it to other state-of-the-art approaches on a diverse set of environments. Our evaluation shows that our method outperforms the other approaches, especially concerning run-time and compute efficiency.

University of Bonn (DE), Robert Bosch (Taiwan) (TW)
HORIZON EUROPE Framework Programme
Openalex Percentile: Top 47%
Remote Sensing and LiDAR Applications
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.