MLESAC: a new robust estimator with application to estimating image geometry
Computer Vision and Image Understanding - Special issue on robusst statistical techniques in image understanding
Multiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Matching with PROSAC " Progressive Sample Consensus
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Guided-MLESAC: Faster Image Transform Estimation by Using Matching Priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Preemptive RANSAC for live structure and motion estimation
Machine Vision and Applications
A Comparative Analysis of RANSAC Techniques Leading to Adaptive Real-Time Random Sample Consensus
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Programming the Cell Broadband Engine Architecture: Examples and Best Practices
Programming the Cell Broadband Engine Architecture: Examples and Best Practices
An efficient parallel approach to random sample matching (pRANSAM)
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Low-Cost laser range scanner and fast surface registration approach
DAGM'06 Proceedings of the 28th conference on Pattern Recognition
Hi-index | 0.00 |
In this paper, we present fast parallel implementations of the RANSAC algorithm on the Cell processor, a multicore SIMD architecture. We present our developed strategies for efficient parallel implementation of the RANSAC algorithm by exploiting the specific features of the Cell processor. We also discuss our new method for model generation to increase the efficiency of calculation of the Homography transformation by RANSAC. In fact, by using this new method and change of algorithm, we have been able to increase the overall performance by a factor of almost 3. We also discuss in details our approaches for further increasing the efficiency by a careful vectorization of the computation as well as by reducing the communication overhead by overlapping computation and communication. The results of our practical implementations clearly demonstrate that a very high sustained computational performance (in terms of sustained GFLOPS) can be achieved with a minimum of communication overhead, resulting in a capability of real-time generation and evaluation of a very large number of models. With a date set of size 2048 data and a number of 256 models, we have achieved the performance of over 80 sustained GFLOPS. Since the peak computing power of our target architecture is 179 GFLOPS, this represents a sustained performance of about 44% of the peak power, indicating the efficiency of our algorithms and implementations. Our results clearly demonstrate the advantages of parallel implementation of RANSAC on MIMD-SIMD architectures such as Cell processor. They also prove that, by using such a parallel implementation over the sequential one, a problem with a fixed number of iterations (hypothetical models) can be solved much faster leading to a potentially better accuracy of the model.