Advertisement

Sparse Non-linear Least Squares Optimization for Geometric Vision

  • Manolis I. A. Lourakis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6312)

Abstract

Several estimation problems in vision involve the minimization of cumulative geometric error using non-linear least-squares fitting. Typically, this error is characterized by the lack of interdependence among certain subgroups of the parameters to be estimated, which leads to minimization problems possessing a sparse structure. Taking advantage of this sparseness during minimization is known to achieve enormous computational savings. Nevertheless, since the underlying sparsity pattern is problem-dependent, its exploitation for a particular estimation problem requires non-trivial implementation effort, which often discourages its pursuance in practice. Based on recent developments in sparse linear solvers, this paper provides an overview of sparseLM, a general-purpose software package for sparse non-linear least squares that can exhibit arbitrary sparseness and presents results from its application to important sparse estimation problems in geometric vision.

Keywords

Bundle Adjustment Sparsity Pattern Trifocal Tensor Multiple View Geometry Camera Matrice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hartley, R., Zisserman, A.: Multiple View Geometry in Computer Vision, 2nd edn. Cambridge University Press, Cambridge (2004)zbMATHGoogle Scholar
  2. 2.
    Sturm, P., Maybank, S.: A Method for Interactive 3D Reconstruction of Piecewise Planar Objects from Single Images. In: Proc. of BMVC 1999, pp. 265–274 (1999)Google Scholar
  3. 3.
    Sinha, S., Pollefeys, M.: Pan-Tilt-Zoom Camera Calibration and High-Resolution Mosaic Generation. Computer Vision and Image Understanding Journal 103, 170–183 (2006)CrossRefGoogle Scholar
  4. 4.
    Triggs, B., McLauchlan, P., Hartley, R., Fitzgibbon, A.: Bundle Adjustment – A Modern Synthesis. In: Proc. of the Int’l Workshop on Vision Algorithms: Theory and Practice, pp. 298–372 (1999)Google Scholar
  5. 5.
    Lourakis, M.A., Argyros, A.: SBA: A Software Package for Generic Sparse Bundle Adjustment. ACM Trans. Math. Software 36, 1–30 (2009)CrossRefGoogle Scholar
  6. 6.
    Davis, T.: Direct Methods for Sparse Linear Systems. In: Fundamentals of Algorithms. SIAM, Philadelphia (2006)Google Scholar
  7. 7.
    Saad, Y.: Iterative Methods for Sparse Linear Systems. SIAM, Philadelphia (2003)zbMATHGoogle Scholar
  8. 8.
    Nocedal, J., Wright, S.: Numerical Optimization. Springer, New York (1999)zbMATHCrossRefGoogle Scholar
  9. 9.
    Gould, N., Scott, J., Hu, Y.: A Numerical Evaluation of Sparse Direct Solvers for the Solution of Large Sparse Symmetric Linear Systems of Equations. ACM Trans. Math. Softw. 33, 10 (2007)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Amestoy, P., Davis, T., Duff, I.: Algorithm 837: AMD, an Approximate Minimum Degree Ordering Algorithm. ACM Trans. Math. Softw. 30, 381–388 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput. 20, 359–392 (1998)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Barrett, R., Berry, M., Chan, T.F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., der Vorst, H.V.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd edn. SIAM, Philadelphia (1994)Google Scholar
  13. 13.
    Davis, T.: Algorithm 849: A Concise Sparse Cholesky Factorization Package. ACM Trans. Math. Softw. 31, 587–591 (2005)zbMATHCrossRefGoogle Scholar
  14. 14.
    Duff, I.: MA57—A Code for the Solution of Sparse Symmetric Definite and Indefinite Systems. ACM Trans. Math. Softw. 30, 118–144 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Schenk, O., Gartner, K.: Solving Unsymmetric Sparse Systems of Linear Equations with PARDISO. J. of Future Generation Computer Systems 20, 475–487 (2004)CrossRefGoogle Scholar
  16. 16.
    Demmel, J., Eisenstat, S., Gilbert, J., Li, X., Liu, J.: A Supernodal Approach to Sparse Partial Pivoting. SIAM J. Matrix Analysis and Applications 20, 720–755 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Rotkin, V., Toledo, S.: The Design and Implementation of a New Out-of-Core Sparse Cholesky Factorization Method. ACM Trans. Math. Softw. 30, 19–46 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Davis, T.: Algorithm 832: UMFPACK, An Unsymmetric-Pattern Multifrontal Method. ACM Trans. Math. Softw. 30, 196–199 (2004)zbMATHCrossRefGoogle Scholar
  19. 19.
    Chen, Y., Davis, T., Hager, W., Rajamanickam, S.: Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate. ACM Trans. Math. Softw. 35, 1–14 (2008)CrossRefGoogle Scholar
  20. 20.
    Ashcraft, C., Grimes, R.: SPOOLES: An Object-Oriented Sparse Matrix Library. In: Proc. of SIAM Conf. on Parallel Processing for Scientific Computing (1999)Google Scholar
  21. 21.
    Amestoy, P., Duff, I., Koster, J., L’Excellent, J.Y.: A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling. SIAM Journal of Matrix Analysis and Applications 23, 15–41 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Torr, P., Zisserman, A.: Robust Parameterization and Computation of the Trifocal Tensor. Image and Vision Computing 15, 591–605 (1997)CrossRefGoogle Scholar
  23. 23.
    Lourakis, M.: levmar: Levenberg-Marquardt Nonlinear Least Squares Algorithms in C/C++ (2004), http://www.ics.forth.gr/~lourakis/levmar/

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Manolis I. A. Lourakis
    • 1
  1. 1.Institute of Computer Science, Foundation for Research and Technology - HellasHeraklion, CreteGreece

Personalised recommendations