资源论文General and Nested Wiberg Minimization: L2 and Maximum Likelihood

General and Nested Wiberg Minimization: L2 and Maximum Likelihood

2020-04-02 | |  65 |   35 |   0

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 ? U V (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 factoriza- tion to minimize an arbitrary function that is nonlinear in each of two sets of variables. In this paper we focus on the case of L2 minimization and maximum likelihood estimation (MLE), presenting an L2 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 L2 pro jective bundle adjustment, solving for camera ma- trices, points, and pro jective depths.

上一篇:Spatio-Temporal Phrases for Activity Recognition

下一篇:Recognizing Materials from Virtual Examples

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...