Iterative p-shrinkage thresholding algorithm for low Tucker rank tensor recovery

被引:21
作者
Shang, Kun [1 ]
Li, Yu-Fan [2 ]
Huang, Zheng-Hai [3 ]
机构
[1] Hunan Univ, Coll Math & Econometr, Changsha 410082, Hunan, Peoples R China
[2] Sun Yat Sen Univ, Sch Math Zhuhai, Zhuhai 519082, Peoples R China
[3] Tianjin Univ, Sch Math, Tianjin 300072, Peoples R China
基金
中国国家自然科学基金;
关键词
Low tucker rank tensor recovery; Tensor completion; p-shrinkage thresholding; Alternative direction method of multipliers; Image inpainting; MATRIX FACTORIZATION; COMPLETION; IMAGE; DECOMPOSITIONS; OPTIMIZATION; MINIMIZATION; CONVERGENCE;
D O I
10.1016/j.ins.2019.01.031
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Low-rank tensor recovery, as a higher order extension of low-rank matrix recovery, has generated a great deal of research interests in recent years, such as image inpainting, video inpainting, video decoding, scan completion, and so on. In this paper, we propose an easy-to-implement algorithm based on the framework of alternative direction method, named iterative p-shrinkage thresholding algorithm, for solving the low Tucker rank tensor recovery problem. The performance of the proposed algorithm is investigated on both synthetic and real data. Numerical results on simulation data demonstrate that our algorithm can successfully recover varieties of synthetic low Tucker rank tensors in different sampling ratios with better quality compared to the existing state-of-the-art tensor recovery algorithms. Experiments on real data, including colored image inpainting, MRI image inpainting and hyperspectral image inpainting, further illustrate the effectiveness of the proposed iterative p-shrinkage thresholding algorithm. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:374 / 391
页数:18
相关论文
共 50 条
[21]   Tensor completion using total variation and low-rank matrix factorization [J].
Ji, Teng-Yu ;
Huang, Ting-Zhu ;
Zhao, Xi-Le ;
Ma, Tian-Hui ;
Liu, Gang .
INFORMATION SCIENCES, 2016, 326 :243-257
[22]   Matrix factorization for low-rank tensor completion using framelet prior [J].
Jiang, Tai-Xiang ;
Huang, Ting-Zhu ;
Zhao, Xi-Le ;
Ji, Teng-Yu ;
Deng, Liang-Jian .
INFORMATION SCIENCES, 2018, 436 :403-417
[23]   Tensor Decompositions and Applications [J].
Kolda, Tamara G. ;
Bader, Brett W. .
SIAM REVIEW, 2009, 51 (03) :455-500
[24]   Low-rank tensor completion by Riemannian optimization [J].
Kressner, Daniel ;
Steinlechner, Michael ;
Vandereycken, Bart .
BIT NUMERICAL MATHEMATICS, 2014, 54 (02) :447-468
[25]   GLOBAL CONVERGENCE OF SPLITTING METHODS FOR NONCONVEX COMPOSITE OPTIMIZATION [J].
Li, Guoyin ;
Pong, Ting Kei .
SIAM JOURNAL ON OPTIMIZATION, 2015, 25 (04) :2434-2460
[26]   Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms [J].
Li, Yu-Fan ;
Shang, Kun ;
Huang, Zheng-Hai .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 331 :64-81
[27]   Robust Structured Nonnegative Matrix Factorization for Image Representation [J].
Li, Zechao ;
Tang, Jinhui ;
He, Xiaofei .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 29 (05) :1947-1960
[28]   Deep Collaborative Embedding for Social Image Understanding [J].
Li, Zechao ;
Tang, Jinhui ;
Mei, Tao .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (09) :2070-2083
[29]  
Liu G., 2017, Advances in Neural Information Processing Systems, P785
[30]   Tensor Completion for Estimating Missing Values in Visual Data [J].
Liu, Ji ;
Musialski, Przemyslaw ;
Wonka, Peter ;
Ye, Jieping .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (01) :208-220