Robust tensor factorization using R1 norm

Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have been proposed for the study of high dimensional data in a large variety of computer vision applications. An intrinsic limitation of previous tensor reduction methods is the sensitivity to the presence of outliers, because they minimize the sum of squares errors (L2 norm). In this paper, we propose a novel robust tensor factorization method using R1 norm for error accumulation function using robust covariance matrices, allowing the method to be efficiently implemented instead of resorting to quadratic programming software packages as in other L1 norm approaches. Experimental results on face representation and reconstruction show that our new robust tensor factorization method can effectively handle outliers compared to previous tensor based PCA methods.

• Type: Conference
• Year: 2008
• Where: CVPR
• Authors: Heng Huang, Chris H. Q. Ding
• Keywords: Computer Vision, CVPR 2008, Robust Covariance Matrices, Robust Tensor Factorization, Tensor Based Algorithms, Tensor Based Pca, Tensor Factorization Method