This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Quasiconvex Optimization for Robust Geometric Reconstruction
October 2007 (vol. 29 no. 10)
pp. 1834-1847
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show that, for various geometric reconstruction problems, their reprojection error functions share a common and quasiconvex formulation. Based on the quasiconvexity, we present a novel quasiconvex optimization framework in which the geometric reconstruction problems are formulated as a small number of small-scale convex programs that are ready to solve. Our final reconstruction algorithm is simple and has intuitive geometric interpretation. In contrast to existing local minimization approaches, our algorithm is deterministic and guarantees a predefined accuracy of the minimization result.The quasiconvexity also provides an intuitive method to handle directional uncertainties and outliers in measurements. When there are outliers in the measurements, our method provides a mechanism to locate the global minimum of a robust error function. For large scale problems and when computational resources are constrained, we provide an efficient approximation that gives a good upper bound (but not global minimum) on the reconstruction error. We demonstrate the effectiveness of our algorithm by experiments on both synthetic and real data.

[1] R. Hartley and P. Sturn, “Triangulation,” Computer Vision and Image Understanding, vol. 68, no. 2, pp. 146-157, 1997.
[2] R. Haralick, C. Lee, K. Ottenberg, and M. Nolle, “Review and Analysis of Solutions of the 3-Point Perspective Pose Estimation Problem,” Int'l J. Computer Vision, vol. 13, no. 3, pp. 331-356, 1994.
[3] L. Quan and Z. Lan, “Linear n $\geq$ 4-Point Pose Determination,” Proc. Int'l Conf. Computer Vision, pp. 778-783, 1998.
[4] R.I. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision. Cambridge Univ. Press, 2000.
[5] R.I. Hartley and F. Schaffalitzky, “${\rm L}_{\infty}$ Minimization in Geometric Reconstruction Problems,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. (I)504-509, 2004.
[6] Q. Ke and T. Kanade, “Quasiconvex Optimization for Robust Geometric Reconstruction,” Proc. Int'l Conf. Computer Vision, pp.II:986-993, Oct. 2005.
[7] F. Kahl, “Multiple View Geometry and the $l_{\infty}$ -Norm,” Proc. Int'l Conf. Computer Vision, pp. II:1002-1009, Oct. 2005.
[8] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, 2004.
[9] D. Nistér, “Automatic Dense Reconstruction from Uncalibrated Video Sequences,” PhD Thesis, Royal Inst. of Technology KTH, Stockholm, Sweden, 2001.
[10] H. Stewénius, F. Schaffalitzky, and D. Nistér, “How Hard Is 3-View Triangulation Really?” Proc. Int'l Conf. Computer Vision, pp.I:686-693, 2005.
[11] C. Tomasi and T. Kanade, “Shape and Motion from Image Streams Under Orthography: A Factorization Method,” Int'l J. Computer Vision, vol. 9, no. 2, pp. 137-154, 1992.
[12] Z. Zhang, “Determining the Epipolar Geometry and Its Uncertainty: A Review,” Int'l J. Computer Vision, vol. 27, no. 2, pp.161-195, 1998.
[13] D.D. Morris and T. Kanade, “A Unified Factorization Algorithm for Points, Line Segments and Planes with Uncertainty Models,” Proc. Int'l Conf. Computer Vision, pp. 696-702, 1998.
[14] M. Irani and P. Anandan, “Factorization with Uncertainty,” Proc. European Conf. Computer Vision, pp. 539-553, 2000.
[15] Q. Ke and T. Kanade, “Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 1199-1205, 2006.
[16] J. Oliensis, “Exact Two-Image Structure from Motion,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 12, pp. 1618-1633, Dec. 2002.
[17] D. Diel, P. DeBitetto, and S. Teller, “Epipolar Constraints for Vision-Aided Inertial Navigation,” Proc. IEEE Workshop Motion and Video Computing, pp. 221-228, 2005.
[18] M. Uyttendaele, A. Criminisi, S. Kang, S. Winder, R. Hartley, and R. Szeliski, “High-Quality Image-Based Interactive Exploration of Real-World Environments,” IEEE Computer Graphics and Applications, pp. 52-63, 2004.
[19] R.I. Hartley, “Chirality,” Int'l J. Computer Vision, vol. 26, no. 1, pp.41-61, 1998.
[20] J. Shi and C. Tomasi, “Good Features to Track,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 593-600, 1994.
[21] R.M. Steele and C. Jaynes, “Feature Uncertainty Arising from Covariant Image Noise,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 1063-1070, 2005.
[22] P. Torr and A. Zisserman, “MLESAC: A New Robust Estimator with Application to Estimating Image Geometry,” Computer Vision and Image Understanding, vol. 78, no. 1, pp. 138-156, 2000.
[23] J. Sturm, “Using SeDuMi 1.02, A MATLAB Toolbox for Optimization Over Symmetric Cones,” Optimization Methods and Software, vol. 11-12, pp. 625-653, 1999.
[24] P.A. Beardsley, A. Zisserman, and D.W. Murray, “Sequential Updating of Projective and Affine Structure from Motion,” Int'l J. Computer Vision, vol. 23, pp. 235-259, June 1997.
[25] K.N. Kutulakos and S.M. Seitz, “A Theory of Shape by Space Carving,” Int'l J. Computer Vision, vol. 38, no. 3, pp. 199-218, 2000.
[26] B. Triggs, P. McLauchlan, R. Hartley, and A. Fitzgibbon, “Bundle Adjustment—A Modern Synthesis,” Springer Lecture Notes in Computer Science, vol. 1883, pp. 298-372, 2000.

Index Terms:
multi-view geometry, geometric reconstruction, convex programming, directional uncertainty, robust
Citation:
Qifa Ke, Takeo Kanade, "Quasiconvex Optimization for Robust Geometric Reconstruction," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 29, no. 10, pp. 1834-1847, Oct. 2007, doi:10.1109/TPAMI.2007.1083
Usage of this product signifies your acceptance of the Terms of Use.