Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 771-778

  Eriksson, Anders ^a   Van Den Hengel, Anton ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION APPLICATIONS; DIFFERENTIABILITY; EFFICIENT COMPUTATION; FUNDAMENTAL OPERATIONS; LINEAR PROGRAMS; LOW RANK APPROXIMATIONS; LOW-RANK MATRICES; MATRIX; MISSING DATA; OPTIMIZATION SOFTWARE; REAL WORLD DATA;

ALGORITHMS; COMPUTER APPLICATIONS; COMPUTER VISION; FACTORIZATION; SINGULAR VALUE DECOMPOSITION;

COMPUTATIONAL METHODS;

EID: 77955994778     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5540139     Document Type: Conference Paper

References (20)

1. P. Baldi and K. Hornik. Neural networks and principal component analysis: learning from examples without local minima. Neural Netw., 2(1):53-58, 1989. 2
2. M. Bazaraa, H. Sherali, and C. Shetty. Nonlinear Programming, Theory and Algorithms. Wiley, 1993. 5
3. A. Bjorck. Numerical Methods for Least Squares Problems. SIAM, 1995. 3
4. M. J. Black and A. D. Jepson. Eigentracking: Robust matching and tracking of articulated objects using a view-based representation. In International Journal of Computer Vision, volume 26, pages 329-342, 1998. 2
5. A. M. Buchanan and A. W. Fitzgibbon. Damped newton algorithms for matrix factorization with missing data. In Conference on Computer Vision and Pattern Recognition, volume 2, pages 316-322, 2005. 2, 3, 6
6. M. K. Chandraker and D. J. Kriegman. Globally optimal bilinear programming for computer vision applications. In Conference on Computer Vision and Pattern Recognition, 2008. 2
7. C. Croux and P. Filzmoser. Robust factorization of a data matrix. In In COMPSTAT, Proceedings in Computational Statistics, pages 245-249, 1998. 2
8. G. Dantzig. Linear Programming and Extensions . Princeton University Press, 1998. 3
9. F. De La Torre and M. J. Black. A framework for robust subspace learning. Int. J. Comput. Vision, 54(1-3):117-142, 2003. 2
10. R. M. Freund. The sensitivity of a linear program solution to changes in matrix coefficients. Technical report, Massachusetts Institute of Technology, 1984. 3
11. H. Hayakawa. Photometric stereo under a light source with arbitrary motion. Journal of the Optical Society of America A, 11(11), 1992. 1
12. Q. Ke and T. Kanade. A subspace approach to layer extraction. Computer Vision and Pattern Recognition, IEEE Computer Society Conference on, 2001. 1
13. Q. Ke and T. Kanade. Robust L1 norm factorization in the presence of outliers and missing data by alternative convex programming. In Conference on Computer Vision and Pattern Recognition, pages 739-746, Washington , USA, 2005. 2, 3, 5, 7, 8
14. D. G. Luenberger and Y. Ye. Linear and Nonlinear Programming. Springer, 2008. 3
15. E. Oja. A simplified neuron model as a principal component analyzer. Journal of Mathematical Biology, 15:267-273, 1982. 2
16. T. Okatani and K. Deguchi. On the Wiberg algorithm for matrix factorization in the presence of missing components. Int. J. Comput. Vision, 72(3):329-337, 2007. 2
17. H. Shum, K. Ikeuchi, and R. Reddy. Principal component analysis with missing data and its application to polyhedral object modeling. pages 3-39, 2001. 1
18. C. Tomasi and T. Kanade. Shape and motion from image streams under orthography: a factorization method. Int. J. Comput. Vision, 9(2):137-154, 1992. 1
19. M. Turk and A. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, 3(1):71-86, 1991. 1
20. T. Wiberg. Computation of principal components when data are missing. Proc. Second Symp. Computational Statistics, pages 229-236, 1976. 1, 2, 8