Abstract
Wiberg matrix factorization breaks a matrix Y into low-rank factors U and V by solving for V in closed form given U, linearizing V(U) about U, and iteratively minimizing ||Y − UV(U)||2 with respect to U only. This approach factors the matrix while effectively removing V from the minimization. We generalize the Wiberg approach beyond factorization to minimize an arbitrary function that is nonlinear in each of two sets of variables. In this paper we focus on the case of L 2 minimization and maximum likelihood estimation (MLE), presenting an L 2 Wiberg bundle adjustment algorithm and a Wiberg MLE algorithm for Poisson matrix factorization. We also show that one Wiberg minimization can be nested inside another, effectively removing two of three sets of variables from a minimization. We demonstrate this idea with a nested Wiberg algorithm for L 2 projective bundle adjustment, solving for camera matrices, points, and projective depths.
Chapter PDF
References
Wiberg, T.: Computation of principal components when data are missing. In: Second Symposium of Computation Statistics, Berlin, pp. 229–326 (1976)
Okatani, T., Deguchi, K.: On the Wiberg algorithm for matrix factorization in the presence of missing components. International Journal of Computer Vision 72(3) (May 2007)
Okatani, T., Yoshida, T., Deguchi, K.: Efficient algorithm for low-rank matrix factorization with missing components and performance comparison of latest algorithms. In: International Conference on Computer Vision, Barcelona, Spain (November 2011)
Eriksson, A., van den Hengel, A.: Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L 1 norm. In: Computer Vision and Pattern Recognition, San Francisco, CA (June 2010)
Strelow, D.: General and nested wiberg minimization. In: Computer Vision and Pattern Recognition, Providence, RI (June 2012)
Ke, Q., Kanade, T.: Robust L 1 norm factorization in the presence of outliers and missing data by alternative convex programming. In: Computer Vision and Pattern Recognition, San Diego, CA (June 2005)
Ruhe, A., Wedin, P.: Algorithms for separable nonlinear least squares problems. SIAM Review 22(3), 318–337 (1980)
Richards, F.: A method of maximum-likelihood estimation. Journal of the Royal Statistical Society, Series B (Methodological) 23(2), 469–475 (1961)
Poelman, C.: The paraperspective and projective factorization methods for recovering shape and motion. PhD thesis, Carnegie Mellon University (1995)
Fackler, P.L.: Notes on matrix calculus (September 2005), http://www4.ncsu.edu/~pfackler/MatCalc.pdf (accessed August 29, 2011)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes: The Art of Scientific Computing, 3rd edn. Cambridge University Press, New York (2007)
Triggs, B., McLauchlan, P.F., Hartley, R.I., Fitzgibbon, A.W.: Bundle Adjustment – A Modern Synthesis. In: Triggs, B., Zisserman, A., Szeliski, R. (eds.) Vision Algorithms 1999. LNCS, vol. 1883, pp. 298–372. Springer, Heidelberg (2000)
Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401, 788–791 (1999)
Forsyth, D.A., Ponce, J.: Computer vision: A modern approach. Prentice-Hall, Upper Saddle River (2003)
Hartley, R., Zisserman, A.: Multiple view geometry in computer vision, 2nd edn. Cambridge University Press, Cambridge (2003)
Oliensis, J., Hartley, R.: Iterative extensions of the Sturm/Triggs algorithm: convergence and nonconvergence. IEEE PAMI 29(12), 2217–2233 (2007)
Civera, J., Davison, A.J., Montiel, J.M.M.: Struture from motion using the extended Kalman filter. Springer, Berlin (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Strelow, D. (2012). General and Nested Wiberg Minimization: L 2 and Maximum Likelihood. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds) Computer Vision – ECCV 2012. ECCV 2012. Lecture Notes in Computer Science, vol 7578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33786-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-33786-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33785-7
Online ISBN: 978-3-642-33786-4
eBook Packages: Computer ScienceComputer Science (R0)