Fast and Robust Algorithm for Fundamental Matrix Estimation
Fundamental matrix estimation from two views plays an important role in 3D computer vision. In this paper, a fast and robust algorithm is proposed for the fundamental matrix estimation in the presence of outliers. Instead of algebra error, the reprojection error is adopted to evaluate the confidence of the fundamental matrix. Assuming Gaussian image noise, it is proved that the reprojection error can be described by a chi-square distribution, and thus, the outliers can be eliminated using the 3-sigma principle. With this strategy, the inlier set is robustly established in only two steps. Compared to classical RANSAC-based strategies, the proposed algorithm is very efficient with higher accuracy. Experimental evaluations and comparisons with previous methods demonstrate the effectiveness and advantages of the proposed approach.
KeywordsFundamental matrix Robust estimation Outlier elimination
The work is partly supported by the Kansas NASA EPSCoR Program, and the NSFC (61273282).
- 2.Hartley, R.: In defense of the 8-point algorithm. In: Proceedings of the 8th International Conference on Computer Vision, pp. 1064–1070 (1995)Google Scholar
- 8.Chum, O., Matas, J.: Matching with PROSAC - progressive sample consensus. In: IEEE Conference on Computer Vision and Pattern Recognition, June 2005Google Scholar
- 11.Feng, C.L., Hung, Y.S.: A robust method for estimating the fundamental matrix. In: DICTA, pp. 633–642 (2003)Google Scholar
- 12.Huang, J.F., Lai, S.H., Cheng, C.M.: Robust fundamental matrix estimation with accurate outlier detection. J. Inf. Sci. Eng. 23(4), 1213–1225 (2007)Google Scholar
- 13.Carro, A.I., Morros, J.R.: Promeds: an adaptive robust fundamental matrix estimation approach. In: 3DTV-Conference, pp. 1–4. IEEE (2012)Google Scholar
- 16.Wang, G., Zelek, J., Wu, J., Bajcsy, R.: Robust rank-4 affine factorization for structure from motion. In: IEEE WACV, pp. 180–185 (2013)Google Scholar