Novel methods for multilinear data completion and de-noising based on tensor-SVD

被引:675
作者
Zhang, Zemin [1 ]
Ely, Gregory [1 ]
Aeron, Shuchin [1 ]
Hao, Ning [2 ]
Kilmer, Misha [2 ]
机构
[1] Tufts Univ, Dept ECE, Medford, MA 02155 USA
[2] Tufts Univ, Dept Math, Medford, MA 02155 USA
来源
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) | 2014年
关键词
FACTORIZATION;
D O I
10.1109/CVPR.2014.485
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we propose novel methods for completion (from limited samples) and de-noising of multilinear (tensor) data and as an application consider 3-D and 4-D (color) video data completion and de-noising. We exploit the recently proposed tensor-Singular Value Decomposition (t-SVD)[11]. Based on t-SVD, the notion of multilinear rank and a related tensor nuclear norm was proposed in [11] to characterize informational and structural complexity of multilinear data. We first show that videos with linear camera motion can be represented more efficiently using t-SVD compared to the approaches based on vectorizing or flattening of the tensors. Since efficiency in representation implies efficiency in recovery, we outline a tensor nuclear norm penalized algorithm for video completion from missing entries. Application of the proposed algorithm for video recovery from missing entries is shown to yield a superior performance over existing methods. We also consider the problem of tensor robust Principal Component Analysis (PCA) for de-noising 3-D video data from sparse random corruptions. We show superior performance of our method compared to the matrix robust PCA adapted to this setting as proposed in [4].
引用
收藏
页码:3842 / 3849
页数:8
相关论文
共 20 条
[1]  
[Anonymous], 1995, J Convex Anal
[2]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[3]   Third-order tensors as linear operators on a space of matrices [J].
Braman, Karen .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 433 (07) :1241-1253
[4]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[5]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[6]  
Ely G., 2013, P IEEE INT C AC SPEE
[7]  
Ely Gregory., 2013, Society of Exploration Geophysicists
[8]   Tensor completion and low-n-rank tensor recovery via convex optimization [J].
Gandy, Silvia ;
Recht, Benjamin ;
Yamada, Isao .
INVERSE PROBLEMS, 2011, 27 (02)
[9]  
Hao N. H., 2012, SIAM J IMAGING SCI
[10]  
Hazan E., 2012, J MACHINE LEARNING R, V23