LOW-RANK QUATERNION TENSOR COMPLETION FOR COLOR VIDEO INPAINTING VIA A NOVEL FACTORIZATION STRATEGY

被引:0
作者
Qin, Zhenzhi [1 ]
Ming, Zhenyu [2 ]
Sun, Defeng [3 ]
Zhang, Liping [4 ]
机构
[1] Tsinghua Univ, Dept Math Sci, New Sci Bldg A 302, Beijing 100084, Peoples R China
[2] Huawei Technol Co Ltd, Cent Res Inst, Theory Lab, Hung Hom,Labs 2012,Kowloon, Hong Kong, Peoples R China
[3] Hong Kong Polytech Univ, Dept Appl Math, HungHom, Kowloon, Hong Kong, Peoples R China
[4] Tsinghua Univ, Dept Math Sci, New Sci Bldg A302, Beijing 100084, Peoples R China
关键词
Quaternion tensor; singular value decomposition; low-rank tensor completion; color video recovery; ALGORITHM; CONVERGENCE; MATRICES;
D O I
10.1090/mcom/4025
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
. Recently, a quaternion tensor product named Qt-product was proposed, and then the singular value decomposition and the rank of a third-order quaternion tensor were given. From a more applicable perspective, we extend the Qt-product and propose a novel multiplication principle for third-order quaternion tensor named gQt-product. With the gQt-product, we introduce a brand-new singular value decomposition for third-order quaternion tensors named gQt-SVD and then define gQt-rank and multi-gQt-rank. We prove that the optimal low-rank approximation of a third-order quaternion tensor exists and some numerical experiments demonstrate the low-rankness of color videos. So, we apply the low-rank quaternion tensor completion to color video inpainting problems and present alternating least-square algorithms to solve the proposed low gQt-rank and multi-gQt-rank quaternion tensor completion models. The convergence analyses of the proposed algorithms are established and some numerical experiments on various color video datasets show the high recovery accuracy and computational efficiency of our methods.
引用
收藏
页码:2409 / 2456
页数:48
相关论文
共 43 条
[1]   Scalable tensor factorizations for incomplete data [J].
Acar, Evrim ;
Dunlavy, Daniel M. ;
Kolda, Tamara G. ;
Morup, Morten .
CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 2011, 106 (01) :41-56
[2]  
[Anonymous], MATRIX COMPUTATIONS
[3]   On the convergence of the proximal algorithm for nonsmooth functions involving analytic features [J].
Attouch, Hedy ;
Bolte, Jerome .
MATHEMATICAL PROGRAMMING, 2009, 116 (1-2) :5-16
[4]   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
[5]   2-POINT STEP SIZE GRADIENT METHODS [J].
BARZILAI, J ;
BORWEIN, JM .
IMA JOURNAL OF NUMERICAL ANALYSIS, 1988, 8 (01) :141-148
[6]   THE LOJASIEWICZ INEQUALITY FOR NONSMOOTH SUBANALYTIC FUNCTIONS WITH APPLICATIONS TO SUBGRADIENT DYNAMICAL SYSTEMS [J].
Bolte, Jerome ;
Daniilidis, Aris ;
Lewis, Adrian .
SIAM JOURNAL ON OPTIMIZATION, 2007, 17 (04) :1205-1223
[7]   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
[8]   ANALYSIS OF INDIVIDUAL DIFFERENCES IN MULTIDIMENSIONAL SCALING VIA AN N-WAY GENERALIZATION OF ECKART-YOUNG DECOMPOSITION [J].
CARROLL, JD ;
CHANG, JJ .
PSYCHOMETRIKA, 1970, 35 (03) :283-&
[9]  
Chen Y., 2020, arXiv
[10]   Low-Rank Quaternion Approximation for Color Image Processing [J].
Chen, Yongyong ;
Xiao, Xiaolin ;
Zhou, Yicong .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2020, 29 :1426-1439