Abstract
An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. In order to put into correspondence two maps, most methods estimate the transformation relating the maps from matches established between low level feature extracted from sensor data. However, finding explicit matches between features is a challenging and computationally expensive task. In this paper, we propose a new method to align obstacle maps without searching explicit matches between features. The maps are obtained from a stereo pair. Then, we use a vocabulary tree approach to identify putative corresponding maps followed by the Newton minimization algorithm to find the transformation that relates both maps. The proposed method is evaluated in a typical office environment showing good performance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Besl, P.J., McKay, N.D.: A method for registration of 3-D shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14(2), 239–256 (1992)
Biber, P., Straßer, W.: The normal distributions transform: A new approach to laser scan matching. In: Proc. of Int. Conf. on Intel. Robots and Systems (2003)
Newman, P., Ho, K.: SLAM - Loop Closing with Visually Salient Features. In: Proc. of the Int. Conf. on Robotics and Automation (ICRA), April 18-22 (2005)
Se, S., Lowe, D., Little, J.: Vision-based mobile robot localization and mapping using scale-invariant features. In: Proc. of Int. Conf. on Rob. and Aut. (2001)
Davison, A., et al.: MonoSLAM: Real-time single camera SLAM. IEEE Trans. Pattern Anal. Mach. Intell. 26(6), 1052–1067 (2007)
Nister, D., Stewenius, H.: Scalable recognition with a vocabulary tree. In: Proc. of the Conf. on Computer Vision and Pattern Recognition (CVPR), pp. 2161–2168 (2006)
Mühlmann, K., et al.: Calculating dense disparity maps from color stereo images, an efficient implementation. Int. J. Comput. Vision 47(1-3), 79–88 (2002)
Sivic, J., Zisserman, A.: A text retrieval approach to object matching in videos. In: Proc. of the Int. Conf. on Computer Vision, ICCV (October 2003)
Csurka, G.: Visual categorization with bags of keypoints. In: Workshop on Statistical Learning in Computer Vision, ECCV, p. 22 (2004)
Mikolajczyk, K., Schmid, C.: A performance evaluation of local descriptors. IEEE Trans. Pattern Anal. Mach. Intell. 27(10), 1615–1630 (2005)
Mikolajczyk, K., et al.: A comparison of affine region detectors. Int. J. Comput. Vision 65(1-2), 43–72 (2005)
Matas, J., et al.: Robust wide-baseline stereo from maximally stable extremal regions. Image and Vision Computing 22(10), 761–767 (2004)
Bay, H., et al.: Speeded-up robust features (SURF). Comput. Vis. Image Underst. 110(3), 346–359 (2008)
Nello, C., John, S.: An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, Cambridge (2000)
Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision 60(2), 91–110 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aldavert, D., Ramisa, A., Toledo, R., López de Mántaras, R. (2009). Visual Registration Method for a Low Cost Robot. In: Fritz, M., Schiele, B., Piater, J.H. (eds) Computer Vision Systems. ICVS 2009. Lecture Notes in Computer Science, vol 5815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04667-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-04667-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04666-7
Online ISBN: 978-3-642-04667-4
eBook Packages: Computer ScienceComputer Science (R0)