Back to Top

Adaptive Iterative Closest Keypoint

J. Ekekrantz, A. Pronobis, J. Folkesson, P. Jensfelt

In Proceedings of the 6th European Conference on Mobile Robots (ECMR), 2013.

About

Finding accurate correspondences between overlapping 3D views is crucial for many robotic applications, from multi-view 3D object recognition to SLAM. This step, often referred to as view registration, plays a key role in determining the overall system performance. In this paper, we propose a fast and simple method for registering RGB-D data, building on the principle of the Iterative Closest Point (ICP) algorithm. In contrast to ICP, our method exploits both point position and visual appearance and is able to smoothly transition the weighting between them with an adaptive metric. This results in robust initial registration based on appearance and accurate final registration using 3D points. Using keypoint clustering we are able to utilize a non exhaustive search strategy, reducing runtime of the algorithm significantly. We show through an evaluation on an established benchmark that the method significantly outperforms current methods in both robustness and precision.

BibTeX

@inproceedings{ekekrantz2013ecmr,
  author =       {Ekekrantz, Johan and Pronobis, Andrzej and Folkesson, John and Jensfelt, Patric},
  title =        {Adaptive Iterative Closest Keypoint},
  booktitle =    {Proceedings of the 6th European Conference on Mobile Robots (ECMR)},
  year =         2013,
  month =        sep,
  address =      {Barcelona, Spain},
  doi =          {10.1109/ECMR.2013.6698824},
  url =          {http://www.pronobis.pro/publications/ekekrantz2013ecmr}
}
© 2018. Copyright Andrzej Pronobis
  • stackoverflow
  • scholar