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. © 2012 Springer-Verlag.
CITATION STYLE
Strelow, D. (2012). General and nested Wiberg minimization: L 2 and maximum likelihood. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7578 LNCS, pp. 195–207). https://doi.org/10.1007/978-3-642-33786-4_15
Mendeley helps you to discover research relevant for your work.