Abstract
If we take two images of a planar surface from two different places, the two images are related by a mapping called a homography. Computing a homography from point correspondences over two images is one of the most fundamental processes of computer vision. This is because, among other things, the 3D positions of the planar surface we are viewing and the two cameras that took the images can be computed from the computed homography. Such applications are discussed in Chaps. 7 and 8. This chapter describes the principles and typical computational procedures for accurately computing the homography by considering the statistical properties of the noise involved in correspondence detection. As in ellipse fitting and fundamental matrix computation, the methods are classified into algebraic (least squares, iterative reweight, the Taubin method, renormalization, HyperLS, and hyper-renormalization) and geometric (FNS, geometric distance minimization, and hyperaccurate correction). We also describe the RANSAC procedure for removing wrong correspondences (outliers).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
R. Hartley, A. Zisserman, Multiple View Geometry in Computer Vision, 2nd edn. (Cambridge University Press, Cambridge, U.K., 2003)
K. Kanatani, Geometric Computation for Machine Vision (Oxford University Press, Oxford, U.K., 1993)
K. Kanatani, Statistical Optimization for Geometric Computation: Theory and Practice (Elsevier, Amsterdam, The Netherlands, 1996). Reprinted by Dover, New York, U.S. (2005)
K. Kanatani, N. Ohta, Y. Kanazawa, Optimal homography computation with a reliability measure, in IEICE Transactions on Information and Systems, vol. E83-D, No. 7, pp. 1369–1374 (2000)
K. Kanatani, A. Al-Sharadqah, N. Chernov, Y. Sugaya, Hyper-renormalization: non-minimization approach for geometric estimation. IPSJ Trans. Comput. Vis. Appl. 6, 143–159 (2014)
P. Rangarajan, P. Papamichalis, Estimating homographies without normalization, in Proceedings of International Conference on Image Processing, Cairo, Egypt, pp. 3517–3520 (2009)
K. Kanatani, P. Rangarajan, Y. Sugaya, H. Niitsuma, HyperLS and its applications. IPSJ Trans. Comput. Vis. Appl. 3, 80–94 (2011)
T. Scoleri, W. Chojnacki, M.J. Brooks, A multi-objective parameter estimation for image mosaicing, in Proceedings of 8th International Symposium on Signal Processing and its Applications, Sydney, Australia, vol. 2, pp. 551–554 (2005)
K. Kanatani, H. Niitsuma, Optimal two-view planar triangulation. IPSJ Trans. Comput. Vis. Appl. 3, 67–79 (2011)
K. Kanatani, Y. Sugaya, Hyperaccurate correction of maximum likelihood for geometric estimation. IPSJ Trans. Comput. Vis. Appl. 5, 19–29 (2013)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Kanatani, K., Sugaya, Y., Kanazawa, Y. (2016). Homography Computation. In: Guide to 3D Vision Computation. Advances in Computer Vision and Pattern Recognition. Springer, Cham. https://doi.org/10.1007/978-3-319-48493-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-48493-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48492-1
Online ISBN: 978-3-319-48493-8
eBook Packages: Computer ScienceComputer Science (R0)