Abstract | ||
---|---|---|
Point cloud registration is an essential part for many robotics applications and this problem is usually addressed using some of the existing variants of the Iterative Closest Point (ICP) algorithm. In this paper we propose a novel variant of the ICP objective function which is minimized while searching for the registration. We show how this new function, which relies not only on the point distance, but also on the difference between surface normals or surface tangents, improves the registration process. Experiments are performed on synthetic data and real standard benchmark datasets, showing that our approach outperforms other state of the art techniques in terms of convergence speed and robustness. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1007/978-3-319-11900-7_48 | SIMPAR |
Keywords | Field | DocType |
icp,point cloud registration,surface normals | Convergence (routing),Computer vision,Computer science,Algorithm,Real-time computing,Robustness (computer science),Synthetic data,Tangent,Artificial intelligence,Point cloud,Robotics,Iterative closest point | Conference |
Volume | ISSN | Citations |
8810 | 0302-9743 | 4 |
PageRank | References | Authors |
0.45 | 4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jacopo Serafin | 1 | 12 | 1.67 |
Giorgio Grisetti | 2 | 2362 | 130.91 |