Efficient planar features matching for robot localization using GPU

7Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Matching image features between an image and a map of landmarks is usually a time consuming process in mobile robot localization or Simultaneous Localisation And Mapping algorithms. The main problem is being able to match features in spite of viewpoint changes. Methods based on interest point descriptors such as SIFT have been implemented on GPUs to reach real time performance. In this paper, we present another way to match features with the use of a local 3D model of the features and a motion model of the robot. This matching algorithm dedicated to robot localization would be much too slow if executed on a CPU. Thanks to a GPU implementation, we show that it is possible to achieve real-time performance while offering more robustness than descriptor based methods. © 2010 IEEE.

Cite

CITATION STYLE

APA

Charmette, B., Royer, E., & Chausse, F. (2010). Efficient planar features matching for robot localization using GPU. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Workshops, CVPRW 2010 (pp. 16–23). https://doi.org/10.1109/CVPRW.2010.5543757

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free