Skip to main content

2016 | OriginalPaper | Buchkapitel

Projective Bundle Adjustment from Arbitrary Initialization Using the Variable Projection Method

verfasst von : Je Hyeong Hong, Christopher Zach, Andrew Fitzgibbon, Roberto Cipolla

Erschienen in: Computer Vision – ECCV 2016

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Bundle adjustment is used in structure-from-motion pipelines as final refinement stage requiring a sufficiently good initialization to reach a useful local mininum. Starting from an arbitrary initialization almost always gets trapped in a poor minimum. In this work we aim to obtain an initialization-free approach which returns global minima from a large proportion of purely random starting points. Our key inspiration lies in the success of the Variable Projection (VarPro) method for affine factorization problems, which have close to 100 % chance of reaching a global minimum from random initialization. We find empirically that this desirable behaviour does not directly carry over to the projective case, and we consequently design and evaluate strategies to overcome this limitation. Also, by unifying the affine and the projective camera settings, we obtain numerically better conditioned reformulations of original bundle adjustment algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, New Jersey (2008)CrossRefMATH Absil, P.A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, New Jersey (2008)CrossRefMATH
3.
Zurück zum Zitat Agarwal, S., Snavely, N., Seitz, S.M., Szeliski, R.: Bundle adjustment in the large. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6312, pp. 29–42. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15552-9_3 CrossRef Agarwal, S., Snavely, N., Seitz, S.M., Szeliski, R.: Bundle adjustment in the large. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010. LNCS, vol. 6312, pp. 29–42. Springer, Heidelberg (2010). doi:10.​1007/​978-3-642-15552-9_​3 CrossRef
4.
Zurück zum Zitat Boumal, N., Absil, P.A.: RTRMC: a Riemannian trust-region method for low-rank matrix completion. In: Proceedings of Advances in Neural Information Processing Systems 24 (NIPS 2011), pp. 406–414 (2011) Boumal, N., Absil, P.A.: RTRMC: a Riemannian trust-region method for low-rank matrix completion. In: Proceedings of Advances in Neural Information Processing Systems 24 (NIPS 2011), pp. 406–414 (2011)
5.
Zurück zum Zitat Buchanan, A.M., Fitzgibbon, A.W.: Damped Newton algorithms for matrix factorization with missing data. In: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), vol. 2, pp. 316–322 (2005) Buchanan, A.M., Fitzgibbon, A.W.: Damped Newton algorithms for matrix factorization with missing data. In: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), vol. 2, pp. 316–322 (2005)
6.
Zurück zum Zitat Golub, G.H., Pereyra, V.: The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM J. Numer. Anal. (SINUM) 10(2), 413–432 (1973)MathSciNetCrossRefMATH Golub, G.H., Pereyra, V.: The differentiation of pseudo-inverses and nonlinear least squares problems whose variables separate. SIAM J. Numer. Anal. (SINUM) 10(2), 413–432 (1973)MathSciNetCrossRefMATH
7.
Zurück zum Zitat Golub, G.H., Pereyra, V.: Separable nonlinear least squares: the variable projection method and its applications. In: Proceedings of Inverse Problems, pp. 1–26 (2002) Golub, G.H., Pereyra, V.: Separable nonlinear least squares: the variable projection method and its applications. In: Proceedings of Inverse Problems, pp. 1–26 (2002)
8.
Zurück zum Zitat Gotardo, P.F., Martinez, A.M.: Computing smooth time trajectories for camera and deformable shape in structure from motion with occlusion. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 33(10), 2051–2065 (2011)CrossRef Gotardo, P.F., Martinez, A.M.: Computing smooth time trajectories for camera and deformable shape in structure from motion with occlusion. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 33(10), 2051–2065 (2011)CrossRef
9.
Zurück zum Zitat Hartley, R.I., Zisserman, A.: Multiple View Geometry in Computer Vision, 2nd edn. Cambridge University Press, Cambridge (2004)CrossRefMATH Hartley, R.I., Zisserman, A.: Multiple View Geometry in Computer Vision, 2nd edn. Cambridge University Press, Cambridge (2004)CrossRefMATH
10.
Zurück zum Zitat Hong, J.H., Fitzgibbon, A.W.: Secrets of matrix factorization: approximations, numerics, manifold optimization and random restarts. In: Proceedings of the 2015 IEEE Internatonal Conference on Computer Vision (ICCV), pp. 4130–4138 (2015) Hong, J.H., Fitzgibbon, A.W.: Secrets of matrix factorization: approximations, numerics, manifold optimization and random restarts. In: Proceedings of the 2015 IEEE Internatonal Conference on Computer Vision (ICCV), pp. 4130–4138 (2015)
12.
Zurück zum Zitat Jeong, Y., Nister, D., Steedly, D., Szeliski, R., Kweon, I.S.: Pushing the envelope of modern methods for bundle adjustment. In: Proceedings of the 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1474–1481 (2010) Jeong, Y., Nister, D., Steedly, D., Szeliski, R., Kweon, I.S.: Pushing the envelope of modern methods for bundle adjustment. In: Proceedings of the 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1474–1481 (2010)
13.
Zurück zum Zitat Levenberg, K.: A method for the solution of certain non-linear problems in least squares. Q. Appl. Math. 2(2), 164–168 (1944)MathSciNetMATH Levenberg, K.: A method for the solution of certain non-linear problems in least squares. Q. Appl. Math. 2(2), 164–168 (1944)MathSciNetMATH
14.
Zurück zum Zitat Manton, J.H., Mahony, R., Hua, Y.: The geometry of weighted low-rank approximations. IEEE Trans. Sig. Process. 51(2), 500–514 (2003)MathSciNetCrossRef Manton, J.H., Mahony, R., Hua, Y.: The geometry of weighted low-rank approximations. IEEE Trans. Sig. Process. 51(2), 500–514 (2003)MathSciNetCrossRef
15.
Zurück zum Zitat Marquardt, D.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Indus. Appl. Math. 11(2), 431–441 (1963)MathSciNetCrossRefMATH Marquardt, D.: An algorithm for least-squares estimation of nonlinear parameters. J. Soc. Indus. Appl. Math. 11(2), 431–441 (1963)MathSciNetCrossRefMATH
16.
Zurück zum Zitat Mishra, B., Meyer, G., Bach, F., Sepulchre, R.: Low-rank optimization with trace norm penalty. SIAM J. Optim. (SIOPT) 23(4), 2124–2149 (2013)MathSciNetCrossRefMATH Mishra, B., Meyer, G., Bach, F., Sepulchre, R.: Low-rank optimization with trace norm penalty. SIAM J. Optim. (SIOPT) 23(4), 2124–2149 (2013)MathSciNetCrossRefMATH
17.
Zurück zum Zitat Okatani, T., Yoshida, T., Deguchi, K.: Efficient algorithm for low-rank matrix factorization with missing components and performance comparison of latest algorithms. In: Proceedings of the 2011 IEEE International Conference on Computer Vision (ICCV), pp. 842–849 (2011) Okatani, T., Yoshida, T., Deguchi, K.: Efficient algorithm for low-rank matrix factorization with missing components and performance comparison of latest algorithms. In: Proceedings of the 2011 IEEE International Conference on Computer Vision (ICCV), pp. 842–849 (2011)
18.
19.
20.
Zurück zum Zitat Strelow, D.: General and nested Wiberg minimization: L2 and maximum likelihood. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7578, pp. 195–207. Springer, Heidelberg (2012). doi:10.1007/978-3-642-33786-4_15 CrossRef Strelow, D.: General and nested Wiberg minimization: L2 and maximum likelihood. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7578, pp. 195–207. Springer, Heidelberg (2012). doi:10.​1007/​978-3-642-33786-4_​15 CrossRef
21.
Zurück zum Zitat Sturm, P., Triggs, B.: A factorization based algorithm for multi-image projective structure and motion. In: Buxton, B., Cipolla, R. (eds.) ECCV 1996. LNCS, vol. 1065, pp. 709–720. Springer, Heidelberg (1996). doi:10.1007/3-540-61123-1_183 Sturm, P., Triggs, B.: A factorization based algorithm for multi-image projective structure and motion. In: Buxton, B., Cipolla, R. (eds.) ECCV 1996. LNCS, vol. 1065, pp. 709–720. Springer, Heidelberg (1996). doi:10.​1007/​3-540-61123-1_​183
22.
Zurück zum Zitat Tomasi, C., Kanade, T.: Shape and motion from image streams under orthography: a factorization method. Int. J. Comput. Vis. (IJCV) 9(2), 137–154 (1992)CrossRef Tomasi, C., Kanade, T.: Shape and motion from image streams under orthography: a factorization method. Int. J. Comput. Vis. (IJCV) 9(2), 137–154 (1992)CrossRef
23.
Zurück zum Zitat Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle adjustment - a modern synthesis. In: Proceedings of the International Workshop on Vision Algorithms: Theory and Practice, ICCV 1999, pp. 298–372 (2000) Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle adjustment - a modern synthesis. In: Proceedings of the International Workshop on Vision Algorithms: Theory and Practice, ICCV 1999, pp. 298–372 (2000)
24.
Zurück zum Zitat Wiberg, T.: Computation of principal components when data are missing. In: Proceedings of the 2nd Symposium of Computational Statistics, pp. 229–326 (1976) Wiberg, T.: Computation of principal components when data are missing. In: Proceedings of the 2nd Symposium of Computational Statistics, pp. 229–326 (1976)
25.
Zurück zum Zitat Zach, C.: Robust bundle adjustment revisited. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8693, pp. 772–787. Springer, Heidelberg (2014). doi:10.1007/978-3-319-10602-1_50 Zach, C.: Robust bundle adjustment revisited. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8693, pp. 772–787. Springer, Heidelberg (2014). doi:10.​1007/​978-3-319-10602-1_​50
Metadaten
Titel
Projective Bundle Adjustment from Arbitrary Initialization Using the Variable Projection Method
verfasst von
Je Hyeong Hong
Christopher Zach
Andrew Fitzgibbon
Roberto Cipolla
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-46448-0_29