Tensor Factorization with Total Variation and Tikhonov Regularization for Low-Rank Tensor Completion in Imaging Data

被引:18
作者
Lin, Xue-Lei [1 ]
Ng, Michael K. [2 ]
Zhao, Xi-Le [3 ]
机构
[1] Hong Kong Baptist Univ, Dept Math, Kowloon Tong, Hong Kong, Peoples R China
[2] Univ Hong Kong, Dept Math, Pokfulam, Hong Kong, Peoples R China
[3] Univ Elect Sci & Technol China, Sch Math Sci, Chengdu 611731, Sichuan, Peoples R China
关键词
Tensor factorization; Hybrid regularization; Tensor completion; Proximal alternating minimization; COORDINATE DESCENT METHOD; CONVEX-OPTIMIZATION; DECOMPOSITION; MINIMIZATION; CONVERGENCE; ALGORITHMS; FRAMEWORK; NOISE; MODEL;
D O I
10.1007/s10851-019-00933-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The main aim of this paper is to study tensor factorization for low-rank tensor completion in imaging data. Due to the underlying redundancy of real-world imaging data, the low-tubal-rank tensor factorization (the tensor-tensor product of two factor tensors) can be used to approximate such tensor very well. Motivated by the spatial/temporal smoothness of factor tensors in real-world imaging data, we propose to incorporate a hybrid regularization combining total variation and Tikhonov regularization into low-tubal-rank tensor factorization model for low-rank tensor completion problem. We also develop an efficient proximal alternating minimization (PAM) algorithm to tackle the corresponding minimization problem and establish a global convergence of the PAM algorithm. Numerical results on color images, color videos, and multispectral images are reported to illustrate the superiority of the proposed method over competing methods.
引用
收藏
页码:900 / 918
页数:19
相关论文
共 51 条
[1]  
[Anonymous], 2017, P IEEE C COMP VIS PA
[2]  
[Anonymous], P INT C NEUR INF PRO
[3]  
[Anonymous], 2014, P IEEE C COMP VIS PA
[4]  
[Anonymous], 2013, REAL ALGEBRAIC GEOME
[5]  
[Anonymous], 2016, P IEEE C COMP VIS PA
[6]  
[Anonymous], 2017, P 31 AAAI C ART INT
[7]   Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods [J].
Attouch, Hedy ;
Bolte, Jerome ;
Svaiter, Benar Fux .
MATHEMATICAL PROGRAMMING, 2013, 137 (1-2) :91-129
[8]   Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality [J].
Attouch, Hedy ;
Bolte, Jerome ;
Redont, Patrick ;
Soubeyran, Antoine .
MATHEMATICS OF OPERATIONS RESEARCH, 2010, 35 (02) :438-457
[9]   ASYMPTOTIC PROPERTIES OF THE FENCHEL DUAL FUNCTIONAL AND APPLICATIONS TO DECOMPOSITION PROBLEMS [J].
AUSLENDER, A .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1992, 73 (03) :427-499
[10]   NUMERICAL METHODS FOR DECOMPOSITION AND MINIMIZATION OF NONDIFFERENTIABLE FUNCTIONS [J].
AUSLENDER, A .
NUMERISCHE MATHEMATIK, 1971, 18 (03) :213-+