Efficient computation of robust weighted low-rank matrix approximations using the L 1 Norm

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 34, Issue 9, 2012, Pages 1681-1690

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

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

L 1 minimization; Low rank matrix approximation

Indexed keywords

DIFFERENTIABILITY; EFFICIENT COMPUTATION; LINEAR PROGRAMS; LOW RANK APPROXIMATIONS; LOW-RANK MATRICES; MISSING DATA; OPTIMIZATION SOFTWARE; SYNTHETIC AND REAL DATA;

COMPUTER VISION; MATRIX ALGEBRA;

APPROXIMATION ALGORITHMS;

ALGORITHM; ANIMAL; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER SIMULATION; FACE; HISTOLOGY; HUMAN; IMAGE PROCESSING; METHODOLOGY; REPRODUCIBILITY;

ALGORITHMS; ANIMALS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; FACE; HUMANS; IMAGE PROCESSING, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS;

EID: 84865593660     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2012.116     Document Type: Article

References (27)

1. C. Tomasi and T. Kanade, "Shape and Motion from Image Streams under Orthography: A Factorization Method", Int'l J. Computer (Pubitemid 23621943)
2. H.-Y. Shum, K. Ikeuchi, and R. Reddy, "Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling", IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 1, pp. 854-867, Sept. 1995.
3. Q. Ke and T. Kanade, "A Subspace Approach to Layer Extraction", Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, 2001.
4. M. Turk and A. Pentland, "Eigenfaces for Recognition", J. Cognitive Neuroscience, vol. 3, no. 1, pp. 71-86, 1991.
5. H. Hayakawa, "Photometric Stereo under a Light Source with Arbitrary Motion", J. Optical Soc. of Am. A, vol. 11, no. 11, pp. 3079-3089, 1992.
6. T. Wiberg, "Computation of Principal Components When Data Are Missing", Proc. Second Symp. Computational Statistics, pp. 229-236, 1976.
7. A. M. Buchanan and A. W. Fitzgibbon, "Damped Newton Algorithms for Matrix Factorization with Missing Data", Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 316-322, 2005.
8. T. Okatani and K. Deguchi, "On the Wiberg Algorithm for Matrix Factorization in the Presence of Missing Components", Int'l J. Computer Vision, vol. 72, no. 3, pp. 329-337, 2007. (Pubitemid 46094755)
9. P. Baldi and K. Hornik, "Neural Networks and Principal Component Analysis: Learning from Examples without Local Minima", Neural Networks, vol. 2, no. 1, pp. 53-58, 1989.
10. E. Oja, "A Simplified Neuron Model as a Principal Component Analyzer", J. Math. Biology, vol. 15, pp. 267-273, 1982. (Pubitemid 13209700)
11. F. De La Torre and M. J. Black, "A Framework for Robust Subspace Learning", Int'l J. Computer Vision, vol. 54, nos. 1-3, pp. 117-142, 2003.
12. H. Aanaes, R. Fisker, K. Astrom, and J. M. Carstensen, "Robust Factorization", IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1215-1225, Sept. 2002. (Pubitemid 35242582)
13. Q. Ke and T. Kanade, "Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming", Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 739-746, 2005. (Pubitemid 43897268)
14. M. J. Black and A. D. Jepson, "Eigentracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation", Int'l J. Computer Vision, vol. 26, pp. 329-342, 1998.
15. C. Croux and P. Filzmoser, "Robust Factorization of a Data Matrix", Proc. Computational Statistics, pp. 245-249, 1998.
16. E. J. Candès, X. Li, Y. Ma, and J. Wright, "Robust Principal Component Analysis?" Computing Research Repository, vol. abs/0912.3599, 2009.
17. M. K. Chandraker and D. J. Kriegman, "Globally Optimal Bilinear Programming for Computer Vision Applications", Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2008.
18. A. Bjorck, Numerical Methods for Least Squares Problems. SIAM, 1995.
19. 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", Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010.
20. G. A. Watson, Approximation Theory and Numerical Methods. Wiley, 1980.
21. R. Fletcher, "A Model Algorithm for Composite Nondifferentiable Optimization Problems", Math. Programming Study, vol. 17, pp. 67-76, 1982.
22. R. Fletcher, Practical Methods of Optimization. second ed., Wiley-Interscience, 1987.
23. Y. Yuan, "Some Properties of Trust Region Algorithms for Nonsmooth Optimization", technical report, 1983.
24. Y. Yuan, "On the Superlinear Convergence of a Trust Region Algorithm for Nonsmooth Optimization", Math. Programming, vol. 31, no. 3, pp. 269-285, 1985. (Pubitemid 15480616)
25. C. Olsson and F. Kahl, "Generalized Convexity in Multiple View Geometry", J. Math. Imaging and Vision, vol. 38, pp. 35-51, 2010.
26. M. Alvira and R. Rifkin, "An Empirical Comparison of SNoW and SVMs for Face Detection", A. I. memo 2001-004, Center for Biological and Computational Learning, MIT, 2001.
27. L. Torresani, A. Hertzmann, and C. Bregler, "Learning Non-Rigid 3D Shape from 2D Motion", Proc. Neural Information Processing Systems, 2003.