Brendan McCane
ABSTRACT
This paper reevaluates the case deletion algorithm for fundamental matrix computation and compares it against two RANSAC variants. The case deletion algorithm has several advantages for use in low-power devices in real-time applications including guaranteed time performance and excellent accuracy. This paper shows that case deletion can be just as accurate, but much more efficient than RANSAC when the ratio of outliers is large.
- H. Bay, T. Tuytelaars, and L. Van Gool. Surf: Speeded up robust features. In Computer Vision--ECCV 2006, pages 404--417. Springer, 2006. Google Scholar
Digital Library
- D. P. Capel. An effective bail-out test for ransac consensus scoring. In Proceedings of the British Machine Vision Conference, pages 629--638, 2005.Google ScholarCross Ref
- O. Chum and J. Matas. Randomized ransac with td,d test. In Proceedings of the British Machine Vision Conference, volume 2, pages 448--457, 2002.Google Scholar
- O. Chum and J. Matas. Matching with prosac-progressive sample consensus. In Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on, volume 1, pages 220--226. IEEE, 2005. Google ScholarDigital Library
- O. Chum and J. Matas. Optimal randomized ransac. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 30(8):1472--1482, 2008. Google ScholarDigital Library
- M. A. Fischler and R. C. Bolles. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6):381--395, 1981. Google ScholarDigital Library
- S. Guaglitz, T. Hollerer, and M. Turk. Evaluation of interest point detectors and feature descriptors for visual tracking. International Journal of Computer Vision, 94:i335--360, 2011. Google ScholarDigital Library
- R. Hartley and A. Zisserman. Multiple view geometry in computer vision. Cambridge university press, 2003. Google ScholarDigital Library
- N. Khan, B. McCane, and S. Mills. Feature set reduction for image matching in large scale environments. In Proceedings of the 27th Conference on Image and Vision Computing New Zealand, pages 67--72. ACM, 2012. Google ScholarDigital Library
- H. C. Longuet-Higgins. A computer algorithm for reconstructing a scene from two projections. Readings in Computer Vision: Issues, Problems, Principles, and Paradigms, MA Fischler and O. Firschein, eds, pages 61--62, 1987. Google ScholarDigital Library
- D. G. Lowe. Distinctive image features from scale-invariant keypoints. International journal of computer vision, 60(2):91--110, 2004. Google ScholarDigital Library
- J. Matas and O. Chum. Randomized ransac with td,d test. Image and Vision Computing, 22(10):837--842, 2004.Google ScholarCross Ref
- D. R. Musser. Introspective sorting and selection algorithms. Softw., Pract. Exper., 27(8):983--993, 1997. Google ScholarDigital Library
- D. Nistér. Preemptive ransac for live structure and motion estimation. Machine Vision and Applications, 16(5):321--329, 2005. Google ScholarDigital Library
- R. Raguram, O. Chum, M. Pollefeys, J. Matas, and J. Frahm. Usac: A universal framework for random sample consensus. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 35(8):2022--2038, 2013. Google ScholarDigital Library
- R. Raguram, J.-M. Frahm, and M. Pollefeys. A comparative analysis of ransac techniques leading to adaptive real-time random sample consensus. In Proceedings of the European Conference on Computer Vision, pages 500--513. Springer, 2008. Google ScholarDigital Library
- P. Torr and D. Murray. The development and comparison of robust methods for estimating the fundamental matrix. International Journal of Computer Vision, 24(3):271--300, 1997. Google ScholarDigital Library
- P. H. Torr and D. W. Murray. The development and comparison of robust methods for estimating the fundamental matrix. International journal of computer vision, 24(3):271--300, 1997. Google ScholarDigital Library
- E. Vincent and R. Laganiere. Matching feature points in stereo pairs: A comparative study of some matching strategies. Machine Graphics and Vision, 10(3):237--260, 2001.Google Scholar
Index Terms
- Case deletion for fundamental matrix computation
Recommendations
An efficient fundamental matrix estimation method for wide baseline images
Fundamental matrix estimation for wide baseline images is significantly difficult due to the fact that the proportion of inliers in putative correspondences is generally very low. Traditional robust fundamental matrix estimation methods, such as RANSAC, ...
Soft decision optimization method for robust fundamental matrix estimation
It is easy to show that in computer vision, there is the closely coupled relation between feature matching and fundamental matrix estimation. The widely used robust methods such as RANSAC and its improved versions separately deal with feature matching ...
Outliers Elimination Based Ransac for Fundamental Matrix Estimation
ICVRV '13: Proceedings of the 2013 International Conference on Virtual Reality and VisualizationOutliers Elimination Based RANSAC for Fundamental Matrix Estimation
Comments