An efficient parallel approach to Random Sample Matching (pRANSAM)

This paper introduces a parallelized variant of the Random Sample Matching (RANSAM) approach, which is a very time and memory efficient enhancement of the common Random Sample Consensus (RANSAC). RANSAM exploits the theory of the birthday attack whose mathematical background is known from cryptography. The RANSAM technique can be applied to various fields of application such as mobile robotics, computer vision, and medical robotics. Since standard computers feature multi-core processors nowadays, a considerable speedup can be obtained by distributing selected subtasks of RANSAM among the available cores. First of all this paper addresses the parallelization of the RANSAM approach. Several important characteristics are derived from a probabilistic point of view. Moreover, we apply a fuzzy criterion to compute the matching quality, which is an important step towards real-time capability. The algorithm has been implemented for Windows and for the QNX RTOS. In an experimental section the performance of both implementations is compared and our theoretical results are validated.

[1]  K. Tanaka,et al.  Towards Constant-Time Robot Localization in Large Dynamic Environments , 2006, 2006 IEEE International Conference on Networking, Sensing and Control.

[2]  Gerd Hirzinger,et al.  Estimating finger contact location and object pose from contact measurements in 3D grasping , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[3]  Friedrich M. Wahl,et al.  Building local metrical and global topological maps using efficient scan matching approaches , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  James J. Little,et al.  Global localization using distinctive visual features , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  S. Petchartee,et al.  Contact Identification using Tactile Arrays , 2007, 2007 IEEE International Symposium on Signal Processing and Information Technology.

[6]  Andreas Nüchter,et al.  Parallelization of Scan Matching for Robotic 3D Mapping , 2007, EMCR.

[7]  Michael A. Greenspan,et al.  The parallel iterative closest point algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[8]  James J. Little,et al.  Vision-based global localization and mapping for mobile robots , 2005, IEEE Transactions on Robotics.

[9]  Sven Molkenstruck,et al.  Low-Cost Laser Range Scanner and Fast Surface Registration Approach , 2006, DAGM-Symposium.

[10]  Evangelos E. Milios,et al.  Globally Consistent Range Scan Alignment for Environment Mapping , 1997, Auton. Robots.

[11]  Ana-Maria Cretu,et al.  Intelligent haptic sensor system for robotic manipulation , 2004, IEEE Transactions on Instrumentation and Measurement.

[12]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.