Abstract
Triangulation consists in finding a 3D point reprojecting the best as possible onto corresponding image points. It is classical to minimize the reprojection error, which, in the pinhole camera model case, is nonlinear in the 3D point coordinates. We study the triangulation of points lying on a 3D line, which is a typical problem for Structure-From-Motion in man-made environments. We show that the reprojection error can be minimized by finding the real roots of a polynomial in a single variable, which degree depends on the number of images. We use a set of transformations in 3D and in the images to make the degree of this polynomial as low as possible, and derive a practical reconstruction algorithm. Experimental comparisons with an algebraic approximation algorithm and minimization of the reprojection error using Gauss-Newton are reported for simulated and real data. Our algorithm finds the optimal solution with high accuracy in all cases, showing that the polynomial equation is very stable. It only computes the roots corresponding to feasible points, and can thus deal with a very large number of views – triangulation from hundreds of views is performed in a few seconds. Reconstruction accuracy is shown to be greatly improved compared to standard triangulation methods that do not take the line constraint into account.
Chapter PDF
Similar content being viewed by others
References
Acton, F.S.: Numerical Methods That Work. Corrected edn. Mathematical Association of America, Washington (1990)
Bartoli, A., Coquerelle, M., Sturm, P.: A framework for pencil-of-points structure-from-motion. In: European Conference on Computer Vision (2004)
Bartoli, A., Sturm, P.: Multiple-view structure and motion from line correspondences. In: International Conference on Computer Vision (2003)
Chum, O., Pajdla, T., Sturm, P.: The geometric error for homographies. Computer Vision and Image Understanding 97(1), 86–102 (2005)
Hartley, R., Schaffalitzky, F.: L∞ minimization in geometric reconstruction problems. In: Conference on Computer Vision and Pattern Recognition (2004)
Hartley, R., Sturm, P.: Triangulation. Computer Vision and Image Understanding 68(2), 146–157 (1997)
Hartley, R.I., Zisserman, A.: Multiple View Geometry in Computer Vision, 2nd edn. Cambridge University Press, Cambridge (2003)
Luong, Q.T., Vieville, T.: Canonic representations for the geometries of multiple projective views. Computer Vision and Image Understanding 64(2), 193–229 (1996)
Nistér, D.: Automatic Dense Reconstruction From Uncalibrated Video Sequences. PhD thesis, Royal Institute of Technology, KTH (March 2001)
Oliensis, J.: Exact two-image structure from motion. Ieee Transactions on Pattern Analysis and Machine Intelligence 24(12), 1618–1633 (2002)
Schaffalitzky, F., Zisserman, A.: Multi-view matching for unordered image sets. In: Proceedings of the European Conference on Computer Vision (2002)
Schmid, C., Zisserman, A.: The geometry and matching of lines and curves ove multiple views. International Journal of Computer Vision 40(3), 199–234 (2000)
Stewénius, H., Schaffalitzky, F., Nistér, D.: How hard is 3-view triangulation really? In: Proceedings of the International Conference on Computer Vision (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bartoli, A., Lapresté, JT. (2006). Triangulation for Points on Lines. In: Leonardis, A., Bischof, H., Pinz, A. (eds) Computer Vision – ECCV 2006. ECCV 2006. Lecture Notes in Computer Science, vol 3953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11744078_15
Download citation
DOI: https://doi.org/10.1007/11744078_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33836-9
Online ISBN: 978-3-540-33837-6
eBook Packages: Computer ScienceComputer Science (R0)