Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Multidirectional Conjugate Gradients for Scalable Bundle Adjustment

  • Conference paper
  • First Online:
Pattern Recognition (DAGM GCPR 2021)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 13024))

Included in the following conference series:

  • 1628 Accesses

Abstract

We revisit the problem of large-scale bundle adjustment and propose a technique called Multidirectional Conjugate Gradients that accelerates the solution of the normal equation by up to 61%. The key idea is that we enlarge the search space of classical preconditioned conjugate gradients to include multiple search directions. As a consequence, the resulting algorithm requires fewer iterations, leading to a significant speedup of large-scale reconstruction, in particular for denser problems where traditional approaches notoriously struggle. We provide a number of experimental ablation studies revealing the robustness to variations in the hyper-parameters and the speedup as a function of problem density.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. 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). https://doi.org/10.1007/978-3-642-15552-9_3

    Chapter  Google Scholar 

  2. Agarwal, S., Snavely, N., Simon, I., Seitz, S.M., Szeliski, R.: Building Rome in a day. In: International Conference on Computer Vision (ICCV) (2009)

    Google Scholar 

  3. Bovet, C., Parret-Fréaud, A., Spillane, N., Gosselet, P.: Adaptive multipreconditioned FETI: scalability results and robustness assessment. Comput. Struct. 193, 1–20 (2017)

    Article  Google Scholar 

  4. Bridson, R., Greif, C.: A multipreconditioned conjugate gradient algorithm. SIAM J. Matrix Anal. Appl. 27(4), 1056–1068 (2006). (electronic)

    Article  MathSciNet  Google Scholar 

  5. Brown, D.C.: A solution to the general problem of multiple station analytical stereo triangulation. RCA-MTP data reduction technical report no. 43 (or AFMTC TR 58–8), Patrick Airforce Base, Florida (1958)

    Google Scholar 

  6. Byrod, M., Aström, K., Lund, S.: Bundle adjustment using conjugate gradients with multiscale preconditioning. In: BMVC (2009)

    Google Scholar 

  7. Dellaert, F., Carlson, J., Ila, V., Ni, K., Thorpe, C.E.: Subgraph-preconditioned conjugate gradients for large scale slam. In: IROS, pp. 2566–2571 (2010)

    Google Scholar 

  8. Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards 49(409–436), 1952 (1953)

    MathSciNet  Google Scholar 

  9. Jeong, Y., Nister, D., Steedly, D., Szeliski, R., Kweon, I.-S.: Pushing the envelope of modern methods for bundle adjustment. In: CVPR, pp. 1474–1481 (2010)

    Google Scholar 

  10. Kushal, A., Agarwal, S.: Visibility based preconditioning for bundle adjustment. In: CVPR (2012)

    Google Scholar 

  11. Lourakis, M., Argyros, A.: Is Levenberg-Marquardt the most efficient optimization algorithm for implementing bundle adjustment. In: International Conference on Computer Vision (ICCV), pp. 1526–1531 (2005)

    Google Scholar 

  12. Mandel, J.: Balancing domain decomposition. Comm. Numer. Methods Eng. 9(3), 233–241 (1993)

    Article  MathSciNet  Google Scholar 

  13. Notay, Y.: Flexible conjugate gradients. SIAM J. Sci. Comput. 22(4), 1444–1460 (2000)

    Article  MathSciNet  Google Scholar 

  14. Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, PHiladelphia (2003)

    Book  Google Scholar 

  15. Spillane, N.: An adaptive multipreconditioned conjugate gradient algorithm. SIAM J. Sci. Comput. 38(3), A1896–A1918 (2016)

    Article  MathSciNet  Google Scholar 

  16. Trefethen, L., Bau, D.: Numerical Linear Algebra. SIAM, Philadelphia (1997)

    Book  Google Scholar 

  17. Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle adjustment — a modern synthesis. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) IWVA 1999. LNCS, vol. 1883, pp. 298–372. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44480-7_21

    Chapter  Google Scholar 

  18. Wu, C., Agarwal, S., Curless, B., Seitz, S.: Multicore bundle adjustment. In: CVPR, pp. 3057–3064 (2011)

    Google Scholar 

  19. Zhou, L., et al.: Stochastic bundle adjustment for efficient and scalable 3D reconstruction. In: Vedaldi, A., Bischof, H., Brox, T., Frahm, J.-M. (eds.) ECCV 2020. LNCS, vol. 12360, pp. 364–379. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-58555-6_22

    Chapter  Google Scholar 

  20. Wilson, K., Snavely, N.: Robust global translations with 1DSfM. In: Fleet, D., Pajdla, T., Schiele, B., Tuytelaars, T. (eds.) ECCV 2014. LNCS, vol. 8691, pp. 61–75. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10578-9_5

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Simon Weber .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Weber, S., Demmel, N., Cremers, D. (2021). Multidirectional Conjugate Gradients for Scalable Bundle Adjustment. In: Bauckhage, C., Gall, J., Schwing, A. (eds) Pattern Recognition. DAGM GCPR 2021. Lecture Notes in Computer Science(), vol 13024. Springer, Cham. https://doi.org/10.1007/978-3-030-92659-5_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-92659-5_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-92658-8

  • Online ISBN: 978-3-030-92659-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics