Title
An efficient parallel approach to random sample matching (pRANSAM)
Abstract
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.
Year
DOI
Venue
2009
10.1109/ROBOT.2009.5152282
ICRA
Keywords
Field
DocType
important characteristic,ransam technique,random sample matching,qnx rtos,mobile robotics,available core,medical robotics,ransam approach,efficient parallel approach,important step,common random sample consensus,pattern matching,parallel processing,robots,multicore processing,application software,mobile robots,random sampling,data mining,computer vision,probability,probability density function,cryptography,real time systems,multicore processor,random processes,robot,fuzzy set theory,multi core processor,mobile robot,simultaneous localization and mapping,real time,mobile computing
RANSAC,Computer science,Stochastic process,Birthday attack,Control engineering,Theoretical computer science,Probabilistic logic,Application software,Computer engineering,Multi-core processor,Pattern matching,Speedup
Conference
Volume
Issue
ISSN
2009
1
1050-4729
Citations 
PageRank 
References 
5
0.46
11
Authors
3
Name
Order
Citations
PageRank
René Iser150.46
Daniel Kubus2489.02
Friedrich M. Wahl3794186.93