Abstract
Triangulation by \(\ell _\infty \) minimisation has become established in computer vision. State-of-the-art \(\ell _\infty \) triangulation algorithms exploit the quasiconvexity of the cost function to derive iterative update rules that deliver the global minimum. Such algorithms, however, can be computationally costly for large problem instances that contain many image measurements. In this paper, we exploit the fact that \(\ell _\infty \) triangulation is an instance of generalised linear programs (GLP) to speed up the optimisation. Specifically, the solution of GLPs can be obtained as the solution on a small subset of the data called the support set. A meta-algorithm is then constructed to efficiently find the support set of a set of image measurements for triangulation. We demonstrate that, on practical datasets, using the meta-algorithm in conjunction with all existing \(\ell _\infty \) triangulation solvers provides faster convergence than directly executing the triangulation routines on the full set of measurements.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. Discret. Comput. Geom. 52, 1–30 (2005)
Agarwal, S., Snavely, N., Seitz, S.: Fast algorithms for \(l_\infty \) problems in multiview geometry. In: CVPR (2008)
Amenta, N.: Helly-type theorems and generalized linear programming. Discret. Comput. Geom. 12, 241–261 (1994)
Clarkson, K.L.: Las Vegas algorithms for linear and integer programming when the dimension is small. J. ACM 42, 488–499 (1995)
Dai, Z., Wu, Y., Zhang, F., Wang, H.: A novel fast method for \(L_{\infty }\) problems in multiview geometry. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7576, pp. 116–129. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33715-4_9
Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13, 492–498 (1967)
Donné, S., Goossens, B., Philips, W.: Point triangulation through polyhedrom collapse using the \(l_\infty \) norm. In: ICCV (2015)
Enqvist, O., Olsson, C., Kahl, F.: Stable structure from motion using rotational consistency. Technical report (2010)
Eriksson, A., Isaksson, M.: Pseudoconvex proximal splitting for \(l_\infty \) problems in multiview geometry. In: CVPR (2014)
Furukawa, Y., Ponce, J.: Accurate, dense, and robust multi-view stereopsis. IEEE TPAMI 32, 1362–1376 (2010)
Gugat, M.: A fast algorithm for a class of generalized fractional programs. Manag. Sci. 42, 1493–1499 (1996)
Hartley, R.I., Schaffalitzky, F.: \(l_\infty \) minimization in geometric reconstruction problems. In: CVPR (2004)
Kahl, F.: Multiple view geometry and the \(l_\infty \) norm. In: ICCV (2005)
Ke, Q., Kanade, T.: Quasiconvex optimization for robust geometric reconstruction. In: ICCV (2005)
Li, H.: Efficient reduction of \(l_\infty \) geometry problems. In: CVPR (2009)
Matoušek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16, 498–516 (1996)
Mur-Artal, R., Tardós, J.D.: Probabilistic semi-dense mapping from highly accurate feature-based monocular SLAM. In: RSS (2015)
Olsson, C., Enqvist, O.: Stable structure from motion for unordered image collections. In: Heyden, A., Kahl, F. (eds.) SCIA 2011. LNCS, vol. 6688, pp. 524–535. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21227-7_49
Olsson, C., Eriksson, A., Kahl, F.: Efficient optimization for \(l_\infty \) problems using pseudoconvexity. In: ICCV (2007)
Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discret. Comput. Geom. 6, 423–434 (1991)
Seo, Y., Hartley, R.I.: A fast method to minimize \(l_\infty \) error norm for geometric vision problems. In: ICCV (2007)
Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 567–579. Springer, Heidelberg (1992). doi:10.1007/3-540-55210-3_213
Sim, K., Hartley, R.: Removing outliers using the \(l_\infty \) norm. In: CVPR (2006)
Snavely, N., Seitz, S.M., Szeliski, R.: Modeling the world from internet photo collections. IJCV 80, 189–210 (2007)
Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11–12, 625–653 (1999)
Acknowledgement
This work was supported by ARC Grant DP160103490.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zhang, Q., Chin, TJ. (2017). An Efficient Meta-Algorithm for Triangulation. In: Chen, CS., Lu, J., Ma, KK. (eds) Computer Vision – ACCV 2016 Workshops. ACCV 2016. Lecture Notes in Computer Science(), vol 10117. Springer, Cham. https://doi.org/10.1007/978-3-319-54427-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-54427-4_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54426-7
Online ISBN: 978-3-319-54427-4
eBook Packages: Computer ScienceComputer Science (R0)