Structure from motion using augmented Lagrangian robust factorization

Proceedings - 2nd Joint 3DIM/3DPVT Conference: 3D Imaging, Modeling, Processing, Visualization and Transmission, 3DIMPVT 2012

Volumn , Issue , 2012, Pages 379-386

  Glashoff, Klaus ^a   Bronstein, Michael M ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

augmented Lagrangian; robust factorization; SfM; structure from motion

Indexed keywords

AUGMENTED LAGRANGIANS; MATRIX FACTORIZATIONS; MEASUREMENT MATRIX; MINIMIZATION METHODS; SFM; STRUCTURE FROM MOTION; SYNTHETIC AND REAL DATA;

FACTORIZATION; IMAGING SYSTEMS; ITERATIVE METHODS; VISUALIZATION;

LAGRANGE MULTIPLIERS;

EID: 84872025125     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/3DIMPVT.2012.27     Document Type: Conference Paper

References (36)

1. A. Buchanan and A. Fitzgibbon. Damped Newton algorithms for matrix factorization with missing data. In Proc. CVPR, 2005.
2. J.-F. Cai, E. J. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM J. Optimization, pages 1956-1982, 2010.
3. E. Candés, J. Romberg, and T. Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. Trans. Information Theory, 52(2):489-509, 2006.
4. E. J. Candés, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? J. ACM, 58(1):1-37, 2009.
5. S. Christy and R. Horaud. A quasi linear reconstruction method from multiple perspective views. In Proc. Intelligent Robots and Systems, 1995.
6. A. Del Bue, J. Xavier, L. Agapito, and M. Paladini. Bilinear modelling via augmented lagrange multipliers (BALM). Trans. PAMI, 34(8):1496-1508, 2012.
7. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statistical Society B, 39(1):1-38, 1977.
8. D. Donoho and M. Elad. Optimally sparse representation in general (nonorthogonal) dictionaries via L1 minimization. PNAS, 100(5), 2003.
9. A. Eriksson and A. van den Hengel. Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm. In Proc. CVPR, 2010.
10. M. Farenzena, A. Fusiello, and R. Gherardi. Structure-andmotion pipeline on a hierarchical cluster tree. In Proc. Workshop on 3D Digital Imaging and Modeling, 2009.
11. A. Ganesh, Z. Lin, J. Wright, L. Wu, M. Chen, and Y. Ma. Fast algorithms for recovering a corrupted low-rank matrix. In Proc. CAMSAP, 2009.
12. J. M. Geusebroek, G. J. Burghouts, and A. W. M. Smeulders. The Amsterdam library of object images. IJCV, 61(1):103-112, 2005.
13. R. Glowinski. Numerical Methods for Nonlinear Variational Problems. Scientific Computation. Springer, 2008.
14. P. Gotardo and A. Martinez. Computing smooth timetrajectories for camera and deformable shape in structure from motion with occlusion. Trans. PAMI, 33(10):2051-2065, 2011.
15. R. Hartley and F. Schaffalitzky. Power factorization: 3D reconstruction with missing or uncertain data. Proc. Australia-Japan Advanced Workshop on Computer Vision, 2003.
16. R. I. Hartley and A. Zisserman. Multiple view geometry in computer vision. Cambridge University Press, 2004.
17. M. R. Hestenes. Multiplier and gradient methods. J. Optimization Theory and Applications, 4(5):303-320, 1969.
18. D. W. Jacobs. Linear fitting with missing data for structurefrom-motion. CVIU, 82:57-81, 1997.
19. Q. Ke and T. Kanade. Robust L1 norm factorization in the presence of outliers and missing data by alternative convex programming. In Proc. CVPR, 2005.
20. Z. Lin, M. Chen, and L. Wu. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. Analysis, 2010.
21. D. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 60(2):91-110, 2004.
22. D. Martinec and T. Pajdla. Structure from many perspective images with occlusions. In Proc. ECCV, 2002.
23. T. Okatani and K. Deguchi. On the Wiberg algorithm for matrix factorization in the presence of missing components. IJCV, 72(3):329-337, 2006.
24. J. Oliensis and R. Hartley. Iterative extensions of the Sturm/Triggs algorithm: Convergence and nonconvergence. In Proc. ECCV, 2006.
25. C. Poelman and T. Kanade. A paraperspective factorization method for shape and motion recovery. In Proc. ECCV, 1994.
26. M. Powell. A method for nonlinear constraints in minimization problems. In R. Fletcher, editor, Optimization, pages 283-298. Academic Press, 1969.
27. S. T. Roweis. EM algorithms for PCA and SPCA. In Proc. NIPS, 1997.
28. Y. Shen, Z. Wen, and Y. Zhang. Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization. Rice University TR 1102, 2011.
29. P. Sturm and B. Triggs. A factorization based algorithm for multi- image projective structure and motion. In Proc. ECCV, 1996.
30. C. Tomasi and T. Kanade. Shape and motion from image streams under orthography: a factorization method. IJCV, 9(2):137-154, 1992.
31. R. Vidal and R. Hartley. Motion segmentation with missing data using power factorization and GPCA. In Proc. CVPR, 2004.
32. Z. Wen. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Rice University TR 1007, 2010.
33. T. Wiberg. Computation of principal components when data are missing. Proc. Symp. Computational Statistics, 1976.
34. W. Yin, S. Osher, D. Goldfarb, and J. Darbon. Bregman iterative algorithms for L1-minimization with applications to compressed sensing. SIAM J Imaging Sci, 1(1):1-24, 2008.
35. X. Yuan and J. Yang. Sparse and low-rank matrix decomposition via alternating direction methods, 2009.
36. A. Zaharescu and R. P. Horaud. Robust factorization methods using a Gaussian/uniform mixture model. IJCV, 81(3):240-258, 2009.