Abstract
In this paper we consider the problem of finding the position of a point in space given its projections in multiple images taken by cameras with known calibration and pose. Ideally the 3D point can be obtained as the intersection of multiple known rays in space. However, with noise the rays do not meet at a single point generally. Therefore, it is necessary to find a best point of intersection. In this paper we propose a modification of the method (Ma et al., 2001. Journal of Communications in Information and Systems, (1):51–73) based on the multiple-view epipolar constraints. The solution is simple in concept and straightforward to implement. It includes generally two steps: first, image points are corrected through approximating the error model to the first order, and then the 3D point can be reconstructed from the corrected image points using any generic triangulation method. Experiments are conducted both on simulated data and on real data to test the proposed method against previous methods. It is shown that results obtained with the proposed method are consistently more accurate than those of other linear methods. When the measurement error of image points is relatively small, its results are comparable to those of maximum likelihood estimation using Newton-type optimizers; and when processing image-point correspondences cross a small number of views, the proposed method is by far more efficient than the Newton-type optimizers.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bartoli, A. 2002. A unified framework for quasi-linear bundle adjustment. In Proc. of the Sixteenth IAPR International Donference on Pattern Recognition, Quebec, Canada, vol. 2, pp. 560–563.
Burington, R.S. and May D.C. 1970. Handbook of Probability and Statistics with Tables:McGraw-Hill Book Company.
Carter, E.S. Generating Gaussian Random Numbers. http://www.taygeta.com/random/gaussian.html.
Chen, Q. and Medioni, G. 1996. Efficient iterative solution to M-view projective reconstruction. In Proc. of ECCV.
Golub, G.H. and Van Loan, C.F. 1996. Matrix Computations. The Johns Hopkins University Press.
Hartley, R. and Sturm, P. 1997. Triangulation. Computer Vision and Image Understanding, 68(2).
Hartley, R. and Schaffalitzky, F. 2004. L⧜ minimization in geometric reconstruction problems. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Hartley, R and Zisserman, A. 2000. Multiple View Geometry in Computer Vision. Cambridge University Press.
Kanatani, K. 1996. Statistical Optimization for Geometric Computation: Theory and Practice. Elsevier.
Ma, Y., Kosecka, J., and Sastry, S. 1999. Optimization criteria and geometric algorithms for motion and structure estimation. Journal of Computer Vision, 44(3):219–249.
Ma, Y., Vidal, R., Hsu, S., and Sastry, S. 2001. Optimal motion estimation from multiple images by normalized epipolar constraint. Journal of Communications in Information and Systems, (1): 51–73.
Mahamud, S., Herbert, M., Omori, Y., and Ponce, J. 2001. Provably-convergent iterative methods for projective structure and motion. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition.
Shi, J. and Tomasi, C. 1994. Good features to track. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition, pp. 593–600.
Weng, J., Huang, T.S., and Ahuja, N. 1993. Optimal motion and structure estimation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(9):864–884.
Zhang, Z. and Shan, Y. 2001. Incremental motion estimation through local bundle adjustment. Technical Report, MSR-TR-01-54.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, B., Yu, M., Maier, D. et al. An Efficient and Accurate Method for 3D-Point Reconstruction from Multiple Views. Int J Comput Vision 65, 175–188 (2005). https://doi.org/10.1007/s11263-005-3670-5
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11263-005-3670-5