TY - GEN
T1 - Element-wise factorization for N-view projective reconstruction
AU - Dai, Yuchao
AU - Li, Hongdong
AU - He, Mingyi
PY - 2010
Y1 - 2010
N2 - Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such as requiring a good initialization, the iteration may not converge or only converge to a local minimum, etc. None of the published works can offer any sort of global optimality guarantee to the problem. In this paper, an optimal solution to projective factorization for structure and motion is presented, based on the same principle of low-rank factorization. Instead of formulating the problem as matrix factorization, we recast it as element-wise factorization, leading to a convenient and efficient semi-definite program formulation. Our method is thus global, where no initial point is needed, and a globally-optimal solution can be found (up to some relaxation gap). Unlike traditional projective factorization, our method can handle real-world difficult cases like missing data or outliers easily, and all in a unified manner. Extensive experiments on both synthetic and real image data show comparable or superior results compared with existing methods.
AB - Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such as requiring a good initialization, the iteration may not converge or only converge to a local minimum, etc. None of the published works can offer any sort of global optimality guarantee to the problem. In this paper, an optimal solution to projective factorization for structure and motion is presented, based on the same principle of low-rank factorization. Instead of formulating the problem as matrix factorization, we recast it as element-wise factorization, leading to a convenient and efficient semi-definite program formulation. Our method is thus global, where no initial point is needed, and a globally-optimal solution can be found (up to some relaxation gap). Unlike traditional projective factorization, our method can handle real-world difficult cases like missing data or outliers easily, and all in a unified manner. Extensive experiments on both synthetic and real image data show comparable or superior results compared with existing methods.
UR - http://www.scopus.com/inward/record.url?scp=78149342096&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15561-1_29
DO - 10.1007/978-3-642-15561-1_29
M3 - Conference contribution
SN - 364215560X
SN - 9783642155604
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 396
EP - 409
BT - Computer Vision, ECCV 2010 - 11th European Conference on Computer Vision, Proceedings
PB - Springer Verlag
T2 - 11th European Conference on Computer Vision, ECCV 2010
Y2 - 10 September 2010 through 11 September 2010
ER -