English

Speeding Up Iterative Closest Point Using Stochastic Gradient Descent

Robotics 2019-07-23 v1 Machine Learning

Abstract

Sensors producing 3D point clouds such as 3D laser scanners and RGB-D cameras are widely used in robotics, be it for autonomous driving or manipulation. Aligning point clouds produced by these sensors is a vital component in such applications to perform tasks such as model registration, pose estimation, and SLAM. Iterative closest point (ICP) is the most widely used method for this task, due to its simplicity and efficiency. In this paper we propose a novel method which solves the optimisation problem posed by ICP using stochastic gradient descent (SGD). Using SGD allows us to improve the convergence speed of ICP without sacrificing solution quality. Experiments using Kinect as well as Velodyne data show that, our proposed method is faster than existing methods, while obtaining solutions comparable to standard ICP. An additional benefit is robustness to parameters when processing data from different sensors.

Keywords

Cite

@article{arxiv.1907.09133,
  title  = {Speeding Up Iterative Closest Point Using Stochastic Gradient Descent},
  author = {Fahira Afzal Maken and Fabio Ramos and Lionel Ott},
  journal= {arXiv preprint arXiv:1907.09133},
  year   = {2019}
}

Comments

7 Pages, 4 Figures, Submitted to ICRA

R2 v1 2026-06-23T10:26:45.556Z