bibliography.rst 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162
  1. .. _sec-bibliography:
  2. ============
  3. Bibliography
  4. ============
  5. Background Reading
  6. ==================
  7. For a short but informative introduction to the subject we recommend
  8. the booklet by [Madsen]_ . For a general introduction to non-linear
  9. optimization we recommend [NocedalWright]_. [Bjorck]_ remains the
  10. seminal reference on least squares problems. [TrefethenBau]_ is our
  11. favorite text on introductory numerical linear algebra. [Triggs]_
  12. provides a thorough coverage of the bundle adjustment problem.
  13. References
  14. ==========
  15. .. [Agarwal] S. Agarwal, N. Snavely, S. M. Seitz and R. Szeliski,
  16. **Bundle Adjustment in the Large**, *Proceedings of the European
  17. Conference on Computer Vision*, pp. 29--42, 2010.
  18. .. [Bjorck] A. Bjorck, **Numerical Methods for Least Squares
  19. Problems**, SIAM, 1996
  20. .. [Brown] D. C. Brown, **A solution to the general problem of
  21. multiple station analytical stereo triangulation**, Technical
  22. Report 43, Patrick Airforce Base, Florida, 1958.
  23. .. [ByrdNocedal] R. H. Byrd, J. Nocedal, R. B. Schanbel,
  24. **Representations of Quasi-Newton Matrices and their use in Limited
  25. Memory Methods**, *Mathematical Programming* 63(4):129-156, 1994.
  26. .. [ByrdSchnabel] R.H. Byrd, R.B. Schnabel, and G.A. Shultz, **Approximate
  27. solution of the trust region problem by minimization over
  28. two dimensional subspaces**, *Mathematical programming*,
  29. 40(1):247-263, 1988.
  30. .. [Chen] Y. Chen, T. A. Davis, W. W. Hager, and
  31. S. Rajamanickam, **Algorithm 887: CHOLMOD, Supernodal Sparse
  32. Cholesky Factorization and Update/Downdate**, *TOMS*, 35(3), 2008.
  33. .. [Conn] A.R. Conn, N.I.M. Gould, and P.L. Toint, **Trust region
  34. methods**, *Society for Industrial Mathematics*, 2000.
  35. .. [Dellaert] F. Dellaert, J. Carlson, V. Ila, K. Ni and C. E. Thorpe,
  36. **Subgraph-preconditioned conjugate gradients for large scale SLAM**,
  37. *International Conference on Intelligent Robots and Systems*, 2010.
  38. .. [GolubPereyra] G.H. Golub and V. Pereyra, **The differentiation of
  39. pseudo-inverses and nonlinear least squares problems whose
  40. variables separate**, *SIAM Journal on numerical analysis*,
  41. 10(2):413-432, 1973.
  42. .. [GouldScott] N. Gould and J. Scott, **The State-of-the-Art of
  43. Preconditioners for Sparse Linear Least-Squares Problems**,
  44. *ACM Trans. Math. Softw.*, 43(4), 2017.
  45. .. [HartleyZisserman] R.I. Hartley & A. Zisserman, **Multiview
  46. Geometry in Computer Vision**, Cambridge University Press, 2004.
  47. .. [Hertzberg] C. Hertzberg, R. Wagner, U. Frese and L. Schroder,
  48. **Integrating Generic Sensor Fusion Algorithms with Sound State
  49. Representations through Encapsulation of Manifolds**, *Information
  50. Fusion*, 14(1):57-77, 2013.
  51. .. [KanataniMorris] K. Kanatani and D. D. Morris, **Gauges and gauge
  52. transformations for uncertainty description of geometric structure
  53. with indeterminacy**, *IEEE Transactions on Information Theory*
  54. 47(5):2017-2028, 2001.
  55. .. [Keys] R. G. Keys, **Cubic convolution interpolation for digital
  56. image processing**, *IEEE Trans. on Acoustics, Speech, and Signal
  57. Processing*, 29(6), 1981.
  58. .. [KushalAgarwal] A. Kushal and S. Agarwal, **Visibility based
  59. preconditioning for bundle adjustment**, *In Proceedings of the
  60. IEEE Conference on Computer Vision and Pattern Recognition*, 2012.
  61. .. [Kanzow] C. Kanzow, N. Yamashita and M. Fukushima,
  62. **Levenberg-Marquardt methods with strong local convergence
  63. properties for solving nonlinear equations with convex
  64. constraints**, *Journal of Computational and Applied Mathematics*,
  65. 177(2):375-397, 2005.
  66. .. [Levenberg] K. Levenberg, **A method for the solution of certain
  67. nonlinear problems in least squares**, *Quart. Appl. Math*,
  68. 2(2):164-168, 1944.
  69. .. [LiSaad] Na Li and Y. Saad, **MIQR: A multilevel incomplete qr
  70. preconditioner for large sparse least squares problems**, *SIAM
  71. Journal on Matrix Analysis and Applications*, 28(2):524-550, 2007.
  72. .. [Madsen] K. Madsen, H.B. Nielsen, and O. Tingleff, **Methods for
  73. nonlinear least squares problems**, 2004.
  74. .. [Mandel] J. Mandel, **On block diagonal and Schur complement
  75. preconditioning**, *Numer. Math.*, 58(1):79-93, 1990.
  76. .. [Marquardt] D.W. Marquardt, **An algorithm for least squares
  77. estimation of nonlinear parameters**, *J. SIAM*, 11(2):431-441,
  78. 1963.
  79. .. [Mathew] T.P.A. Mathew, **Domain decomposition methods for the
  80. numerical solution of partial differential equations**, Springer
  81. Verlag, 2008.
  82. .. [NashSofer] S.G. Nash and A. Sofer, **Assessing a search direction
  83. within a truncated newton method**, *Operations Research Letters*,
  84. 9(4):219-221, 1990.
  85. .. [Nocedal] J. Nocedal, **Updating Quasi-Newton Matrices with Limited
  86. Storage**, *Mathematics of Computation*, 35(151): 773--782, 1980.
  87. .. [NocedalWright] J. Nocedal & S. Wright, **Numerical Optimization**,
  88. Springer, 2004.
  89. .. [Oren] S. S. Oren, **Self-scaling Variable Metric (SSVM) Algorithms
  90. Part II: Implementation and Experiments**, Management Science,
  91. 20(5), 863-874, 1974.
  92. .. [Press] W. H. Press, S. A. Teukolsky, W. T. Vetterling
  93. & B. P. Flannery, **Numerical Recipes**, Cambridge University
  94. Press, 2007.
  95. .. [Ridders] C. J. F. Ridders, **Accurate computation of F'(x) and
  96. F'(x) F"(x)**, Advances in Engineering Software 4(2), 75-76, 1978.
  97. .. [RuheWedin] A. Ruhe and P.Å. Wedin, **Algorithms for separable
  98. nonlinear least squares problems**, Siam Review, 22(3):318-337,
  99. 1980.
  100. .. [Saad] Y. Saad, **Iterative methods for sparse linear
  101. systems**, SIAM, 2003.
  102. .. [Simon] I. Simon, N. Snavely and S. M. Seitz, **Scene Summarization
  103. for Online Image Collections**, *International Conference on Computer Vision*, 2007.
  104. .. [Stigler] S. M. Stigler, **Gauss and the invention of least
  105. squares**, *The Annals of Statistics*, 9(3):465-474, 1981.
  106. .. [TenenbaumDirector] J. Tenenbaum & B. Director, **How Gauss
  107. Determined the Orbit of Ceres**.
  108. .. [TrefethenBau] L.N. Trefethen and D. Bau, **Numerical Linear
  109. Algebra**, SIAM, 1997.
  110. .. [Triggs] B. Triggs, P. F. Mclauchlan, R. I. Hartley &
  111. A. W. Fitzgibbon, **Bundle Adjustment: A Modern Synthesis**,
  112. Proceedings of the International Workshop on Vision Algorithms:
  113. Theory and Practice, pp. 298-372, 1999.
  114. .. [Wiberg] T. Wiberg, **Computation of principal components when data
  115. are missing**, In Proc. *Second Symp. Computational Statistics*,
  116. pages 229-236, 1976.
  117. .. [WrightHolt] S. J. Wright and J. N. Holt, **An Inexact
  118. Levenberg Marquardt Method for Large Sparse Nonlinear Least
  119. Squares**, *Journal of the Australian Mathematical Society Series
  120. B*, 26(4):387-403, 1985.