
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Eriksson, A. van den Hengel, "Efficient Computation of Robust Weighted LowRank Matrix Approximations Using the L_1 Norm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 9, pp. 16811690, Sept., 2012.  
BibTex  x  
@article{ 10.1109/TPAMI.2012.116, author = {A. Eriksson and A. van den Hengel}, title = {Efficient Computation of Robust Weighted LowRank Matrix Approximations Using the L_1 Norm}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {34}, number = {9}, issn = {01628828}, year = {2012}, pages = {16811690}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2012.116}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Efficient Computation of Robust Weighted LowRank Matrix Approximations Using the L_1 Norm IS  9 SN  01628828 SP1681 EP1690 EPD  16811690 A1  A. Eriksson, A1  A. van den Hengel, PY  2012 KW  Robustness KW  Approximation algorithms KW  Equations KW  Least squares approximation KW  Computational efficiency KW  Optimization KW  L_{{1}}minimization. KW  Lowrank matrix approximation VL  34 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] C. Tomasi and T. Kanade, "Shape and Motion from Image Streams under Orthography: A Factorization Method," Int'l J. Computer Vision, vol. 9, no. 2, pp. 137154, 1992.
[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. 854867, 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. 7186, 1991.
[5] H. Hayakawa, "Photometric Stereo under a Light Source with Arbitrary Motion," J. Optical Soc. of Am. A, vol. 11, no. 11, pp. 30793089, 1992.
[6] T. Wiberg, "Computation of Principal Components When Data Are Missing," Proc. Second Symp. Computational Statistics, pp. 229236, 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. 316322, 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. 329337, 2007.
[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. 5358, 1989.
[10] E. Oja, "A Simplified Neuron Model as a Principal Component Analyzer," J. Math. Biology, vol. 15, pp. 267273, 1982.
[11] F. De La Torre and M.J. Black, "A Framework for Robust Subspace Learning," Int'l J. Computer Vision, vol. 54, nos. 13, pp. 117142, 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. 12151225, Sept. 2002.
[13] Q. Ke and T. Kanade, "Robust $L_1$ Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming," Proc. IEEE CS Conf. Computer Vision and Pattern Recognition, pp. 739746, 2005.
[14] M.J. Black and A.D. Jepson, "Eigentracking: Robust Matching and Tracking of Articulated Objects Using a ViewBased Representation," Int'l J. Computer Vision, vol. 26, pp. 329342, 1998.
[15] C. Croux and P. Filzmoser, "Robust Factorization of a Data Matrix," Proc. Computational Statistics, pp. 245249, 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 LowRank Matrix Approximations in the Presence of Missing Data Using the $l_1$ 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. 6776, 1982.
[22] R. Fletcher, Practical Methods of Optimization. second ed., WileyInterscience, 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. 269285, 1985.
[25] C. Olsson and F. Kahl, "Generalized Convexity in Multiple View Geometry," J. Math. Imaging and Vision, vol. 38, pp. 3551, 2010.
[26] M. Alvira and R. Rifkin, "An Empirical Comparison of SNoW and SVMs for Face Detection," A.I. memo 2001004, Center for Biological and Computational Learning, MIT, 2001.
[27] L. Torresani, A. Hertzmann, and C. Bregler, "Learning NonRigid 3D Shape from 2D Motion," Proc. Neural Information Processing Systems, 2003.