Abstract
This paper presents a study on how to numerically solve the feasibility test problem which is the core of the bisection algorithm for minimizing the L ∞ error functions. We consider a strategy that minimizes the maximum infeasibility. The minimization can be performed using several numerical computation methods, among which the barrier method and the primal-dual method are examined. In both of the methods, the inequalities are sequentially approximated by log-barrier functions. An initial feasible solution is found easily by the construction of the feasibility problem, and Newton-style update computes the optimal solution iteratively. When we apply the methods to the problem of estimating the structure and motion, every Newton update requires solving a very large system of linear equations. We show that the sparse bundle-adjustment technique, previously developed for structure and motion estimation, can be utilized during the Newton update. In the primal-dual interior-point method, in contrast to the barrier method, the sparse structure is all destroyed due to an extra constraint introduced for finding an initial solution. However, we show that this problem can be overcome by utilizing the matrix inversion lemma which allows us to exploit the sparsity in the same manner as in the barrier method. We finally show that the sparsity appears in both of the L ∞ formulations - linear programming and second-order cone programming.
This work was supported by the Korea Science and Engineering Foundation(KOSEF) grant funded by the Korean government (MOST) (R01-2006-000-11374-0). This research is accomplished as the result of the research project for culture contents technology development supported by KOCCA.
Chapter PDF
Similar content being viewed by others
References
Hartley, R., Schaffalitzky, F.: L ∞ minimization in geometric reconstruction problems. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition (2004)
Kahl, F.: Multiple view geometry and the L ∞ -norm. In: Proc. Int. Conf. on Computer Vision, Beijing, China, pp. 1002–1009 (2005)
Ke, Q., Kanade, T.: Quasiconvex optimization for robust geometric reconstruction. In: Proc. Int. Conf. on Computer Vision, Beijing, China (2005)
Aström, K., Enquist, O., Olsson, C., Kahl, F., Hartley, R.: An L-infinity approach to structure and motion problems for 1d-vision. In: ICCV 2007 (2007)
Sim, K., Hartley, R.: Recovering camera motion using L ∞ minimization. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition (2006)
Li, H.: A practical algorithm for L ∞ triangulation with outliers. In: IEEE Internatonal Conference on Computer Vision and Pattern Recognition (2007)
Sim, K., Hartley, R.: Removing outliers using the L ∞ norm. In: Proc. IEEE Conf. Computer Vision and Pattern Recognition (2006)
Olsson, C., Anders, P., Eriksson, F.K.: Efficient optimization for L ∞ problems using pseudoconvexity. In: IEEE International Conference on Computer Vision (2007)
Seo, Y., Hartley, R.I.: A fast method to minimize L ∞ error norm for geometric vision problems. In: IEEE International Conference on Computer Vision (2007)
Salzmann, M., Hartley, R., Fua, P.: Convex optimization for deformable surface 3-d tracking. In: IEEE International Conference on Computer Vision (2007)
Hartley, R., Kahl, F.: Global optimization through searching rotation space and optimal estimation of the essential matrix. In: ICCV 2007 (2007)
Sturm, J.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optimization Methods and Software 11–12, 625–653 (1999)
Borchers, B.: CSDP, A C library for semidefinite programming. Optimization Methods and Software 11-12, 613–623 (1999)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial optimization algorithms and complexity. Prentice Hall, Englewood Cliffs (1982)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Hartley, R.I., Zisserman, A.: Multiple View Geometry in Computer Vision. Cambridge University Press, Cambridge (2004)
Triggs, B., McLauchlan, P., Hartley, R., Fitzgibbon, A.: Bundle adjustment – a modern synthesis. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) ICCV-WS 1999. LNCS, vol. 1883. Springer, Heidelberg (2000)
Hartley, R.I.: The chirality. Int. Journal of Computer Vision 26, 41–61 (1998)
Nesterov, Y., Nemirovski, A.: Interior-point polynomial methods in convex programming. Studies in Applied Mathematics, vol. 13. SIAM, Philadelphia (1994)
Lobo, M., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra and its Applications 284, 193–228 (1998)
Agarwal, S., Snavely, N., Seitz, S.: Fast algorithms for l-infinity problems in multiview geometry. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (2008)
Olsson, C., Kahl, F., Oskarsson, M.: Optimal estimation of perspective camera pose. In: International Conference on Pattern Recognition (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seo, Y., Lee, H., Lee, S.W. (2008). Sparse Structures in L-Infinity Norm Minimization for Structure and Motion Reconstruction . In: Forsyth, D., Torr, P., Zisserman, A. (eds) Computer Vision – ECCV 2008. ECCV 2008. Lecture Notes in Computer Science, vol 5302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88682-2_59
Download citation
DOI: https://doi.org/10.1007/978-3-540-88682-2_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88681-5
Online ISBN: 978-3-540-88682-2
eBook Packages: Computer ScienceComputer Science (R0)