Sanghyun Son

PhD student at UMD



WGICP: Differentiable Weighted GICP-Based Lidar Odometry



We can give weights to each point in point clouds, and use those weights in the following GICP step to get better registration results.

Abstract

We present a novel differentiable weighted generalized iterative closest point (WGICP) method applicable to general 3D point cloud data, including that from lidar. Our method builds on differentiable generalized ICP (GICP) and we use the differentiable K-Nearest Neighbors (KNN) algorithm to enhance differentiability. Our differentiable GICP algorithm provides the gradient of output pose estimation with respect to each input point. This allows us to train a neural network to predict its importance, or weight, in order to estimate the correct pose. In contrast to the other ICP-based methods, our formulation reduces the number of points used for GICP by only selecting those with the highest weights and ignoring redundant ones with lower weights. We show that our method improves both the accuracy (up to 30%) and the speed (up to 2×) over the GICP algorithm on the KITTI dataset. We also demonstrate the benefit of WGICP in terms of developing an improved SLAM system.
Share




Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in