Tensor N-tubal rank and its convex relaxation for low-rank tensor recovery

被引:76
作者
Zheng, Yu-Bang [1 ]
Huang, Ting-Zhu [1 ]
Zhao, Xi-Le [1 ]
Jiang, Tai-Xiang [2 ]
Ji, Teng-Yu [3 ]
Ma, Tian-Hui [4 ]
机构
[1] Univ Elect Sci & Technol China, Sch Math Sci, Res Ctr Image & Vis Comp, Chengdu 611731, Sichuan, Peoples R China
[2] Southwestern Univ Finance & Econ, Sch Econ Informat Engn, FinTech Innovat Ctr, Chengdu 611130, Sichuan, Peoples R China
[3] Northwestern Polytech Univ, Sch Math & Stat, Xian 710072, Shaanxi, Peoples R China
[4] Xi An Jiao Tong Univ, Sch Math & Stat, Xian 710049, Shaanxi, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Low-rank tensor recovery (LRTR); Mose-k(1)k(2) tensor unfolding; Tensor N-tubal rank; Weighted sum of tensor nuclear norm (WSTNN); Alternating direction method of multipliers (ADMM); REMOTE-SENSING IMAGES; MATRIX FACTORIZATION; COMPLETION;
D O I
10.1016/j.ins.2020.05.005
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The recent popular tensor tubal rank, defined based on tensor singular value decomposition (t-SVD), yields promising results. However, its framework is applicable only to three-way tensors and lacks the flexibility necessary tohandle different correlations along different modes. To tackle these two issues, we define a new tensor unfolding operator, named mode-k(1)k(2) tensor unfolding, as the process of lexicographically stacking all mode-k(1)k(2) slices of an N-way tensor into a three-way tensor, which is a three-way extension of the well-known mode-k tensor matricization. On this basis, we define a novel tensor rank, named the tensor N-tubal rank, as a vector consisting of the tubal ranks of all mode-k(1)k(2) unfolding tensors, to depict the correlations along different modes. To efficiently minimize the proposed N-tubal rank, we establish its convex relaxation: the weighted sum of the tensor nuclear norm (WSTNN). Then, we apply the WSTNN to low-rank tensor completion (LRTC) and tensor robust principal component analysis (TRPCA). The corresponding WSTNN-based LRTC and TRPCA models are proposed, and two efficient alternating direction method of multipliers (ADMM)-based algorithms are developed to solve the proposed models. Numerical experiments demonstrate that the proposed models significantly outperform the compared ones. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:170 / 189
页数:20
相关论文
共 49 条
[1]   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
[2]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel J. ;
Recht, Benjamin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) :717-772
[3]   Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements [J].
Cao, Wenfei ;
Wang, Yao ;
Sun, Jian ;
Meng, Deyu ;
Yang, Can ;
Cichocki, Andrzej ;
Xu, Zongben .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2016, 25 (09) :4075-4090
[4]  
CARROLL JD, 1980, PSYCHOMETRIKA, V45, P3
[5]   An Overview of Low-Rank Matrix Recovery From Incomplete Observations [J].
Davenport, Mark A. ;
Romberg, Justin .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2016, 10 (04) :608-622
[6]   Low-Rank Tensor Completion Using Matrix Factorization Based on Tensor Train Rank and Total Variation [J].
Ding, Meng ;
Huang, Ting-Zhu ;
Ji, Teng-Yu ;
Zhao, Xi-Le ;
Yang, Jing-Hua .
JOURNAL OF SCIENTIFIC COMPUTING, 2019, 81 (02) :941-964
[7]   Semiblind Hyperspectral Unmixing in the Presence of Spectral Library Mismatches [J].
Fu, Xiao ;
Ma, Wing-Kin ;
Bioucas-Dias, Jose M. ;
Chan, Tsung-Han .
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2016, 54 (09) :5171-5184
[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]   ROBUST LOW-RANK TENSOR RECOVERY: MODELS AND ALGORITHMS [J].
Goldfarb, Donald ;
Qin, Zhiwei .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 2014, 35 (01) :225-253
[10]   Non-local Meets Global: An Integrated Paradigm for Hyperspectral Denoising [J].
He, Wei ;
Yao, Quanming ;
Li, Chao ;
Yokoya, Naoto ;
Zhao, Qibin .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :6861-6870