Bootstrapping Errors-in-Variables Models
The bootstrap is a numerical technique, with solid theoretical foundations, to obtain statistical measures about the quality of an estimate by using only the available data. Performance assessment through bootstrap provides the same or better accuracy than the traditional error propagation approach, most often without requiring complex analytical derivations. In many computer vision tasks a regression problem in which the measurement errors are point dependent has to be solved. Such regression problems are called heteroscedastic and appear in the linearization of quadratic forms in ellipse fitting and epipolar geometry, in camera calibration, or in 3D rigid motion estimation. The performance of these complex vision tasks is difficult to evaluate analytically, therefore we propose in this paper the use of bootstrap. The technique is illustrated for 3D rigid motion and fundamental matrix estimation. Experiments with real and synthetic data show the validity of bootstrap as an evaluation tool and the importance of taking the heteroscedasticity into account.
KeywordsFundamental Matrix Rigid Motion Rotation Error Total Little Square Epipolar Line
Unable to display preview. Download preview PDF.
- 1.K.S. Arun, T.S. Huang and S.D. Blostein, “Least-squares fitting of two 3D point sets”, IEEE Transactions on Pattern Analysis and Machine Intelligence. vol. 9, pp. 698–700, 1987.Google Scholar
- 4.A.C. Davison and D.V. Hinkley, Bootstrap Methods and their Application, Cambridge University Press, 1998.Google Scholar
- 5.B. Efron and R.J. Tibshirani, An Introduction to the Bootstrap, Chapman&Hall, 1993.Google Scholar
- 7.O. Faugeras, Three-dimensional Computer Vision. A Geometric Viewpoint, MIT Press, 1993.Google Scholar
- 9.R.I. Hartley, “In Defense of the 8-Point Algorithm”, Proceedings of the 5th International Conference on Computer Vision, Cambridge (MA), pp. 1064–1070, 1995.Google Scholar
- 12.K. Kanatani, Geometric Computation for Machine Vision, Oxford Science Publications, 1993.Google Scholar
- 14.K. Kanatani, Statistical Optimization for Geometric Computation: Theory and Practice, Elsevier, 1996.Google Scholar
- 15.Y. Leedan and P. Meer, “Estimation with bilinear constraints in computer vision”, Proceedings of the 5th International Conference on Computer Vision, Bombay, India, pp. 733–738, 1998.Google Scholar
- 16.B. Matei and P. Meer, “Optimal rigid motion estimation and performance evaluation with bootstrap”, Proceedings of the Computer Vision and Pattern Recognition 99, Fort Collins Co., vol 1, pp. 339–345, 1999.Google Scholar
- 18.T. Kato, A Short Introduction to Perturbation Theory for Linear Operators, Springer-Verlag, 1982.Google Scholar
- 22.L.L. Scharf, Statistical Signal Processing, Addison-Wesley, 1990.Google Scholar
- 23.E. Trucco and A. Verri, Introductory Techniques for 3-D Computer Vision, Prentice Hall, 1998.Google Scholar