Author:
Blanco Jose-Luis,González-Jiménez Javier,Fernández-Madrigal Juan-Antonio
Abstract
SUMMARYThis paper presents a new approach to matching occupancy grid maps by means of finding correspondences between a set of sparse features detected in the maps. The problem is stated here as a special instance of generic image registration. To cope with the uncertainty and ambiguity that arise from matching grid maps, we introduce a modified RANSAC algorithm which searches for a dynamic number of internally consistent subsets of feature pairings from which to compute hypotheses about the translation and rotation between the maps. By providing a (possibly multi-modal) probability distribution of the relative pose of the maps, our method can be seamlessly integrated into large-scale mapping frameworks for mobile robots. This paper provides a benchmarking of different detectors and descriptors, along extensive experimental results that illustrate the robustness of the algorithm with a 97% success ratio in loop-closure detection for ~1700 matchings between local maps obtained from four publicly available datasets.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,General Mathematics,Software,Control and Systems Engineering
Reference38 articles.
1. Local and global localization for mobile robots using visual landmarks;Se;Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems,2001
2. Fast and accurate SLAM with Rao–Blackwellized particle filters
3. An iterative image registration technique with an application to stereo vision;Lucas;Proc. DARPA Image Understanding Workshop,1981
4. Data association in stochastic mapping using the joint compatibility test
Cited by
33 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献