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

被引:0
|
作者
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
相关论文
共 50 条
  • [1] Tensor N-tubal rank and its convex relaxation for low-rank tensor recovery
    Zheng, Yu-Bang
    Huang, Ting-Zhu
    Zhao, Xi-Le
    Jiang, Tai-Xiang
    Ji, Teng-Yu
    Ma, Tian-Hui
    [J]. Information Sciences, 2020, 532 : 170 - 189
  • [2] Statistical Performance of Convex Low-rank and Sparse Tensor Recovery
    Li, Xiangrui
    Wang, Andong
    Lu, Jianfeng
    Tang, Zhenmin
    [J]. PROCEEDINGS 2017 4TH IAPR ASIAN CONFERENCE ON PATTERN RECOGNITION (ACPR), 2017, : 524 - 529
  • [3] Statistical performance of convex low-rank and sparse tensor recovery
    Li, Xiangrui
    Wang, Andong
    Lu, Jianfeng
    Tang, Zhenmin
    [J]. PATTERN RECOGNITION, 2019, 93 : 193 - 203
  • [4] NON-CONVEX RELAXATION LOW-RANK TENSOR COMPLETION FOR HYPERSPECTRAL IMAGE RECOVERY
    Li, Hanyang
    Liu, Hongyi
    Zhang, Jun
    Wu, Zebin
    Wei, Zhihui
    [J]. 2019 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM (IGARSS 2019), 2019, : 1935 - 1938
  • [5] A new nonconvex relaxation approach for low tubal rank tensor recovery
    Jiang, Baicheng
    Liu, Yanhui
    Zeng, Xueying
    Wang, Weiguo
    [J]. DIGITAL SIGNAL PROCESSING, 2022, 130
  • [6] A Scale-Invariant Relaxation in Low-Rank Tensor Recovery with an Application to Tensor Completion
    Zheng, Huiwen
    Lou, Yifei
    Tian, Guoliang
    Wang, Chao
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2024, 17 (01): : 756 - 783
  • [7] CONDITIONS FOR THE EQUIVALENCE BETWEEN THE LOW-n-RANK TENSOR RECOVERY PROBLEM AND ITS CONVEX RELAXATION
    Zhang, Min
    Huang, Zheng-Hai
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (02): : 365 - 383
  • [8] Robust Low-Rank and Sparse Tensor Decomposition for Low-Rank Tensor Completion
    Shi, Yuqing
    Du, Shiqiang
    Wang, Weilan
    [J]. PROCEEDINGS OF THE 33RD CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2021), 2021, : 7138 - 7143
  • [9] Low-Rank Tensor Completion by Approximating the Tensor Average Rank
    Wang, Zhanliang
    Dong, Junyu
    Liu, Xinguo
    Zeng, Xueying
    [J]. 2021 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2021), 2021, : 4592 - 4600
  • [10] Tensor completion and low-n-rank tensor recovery via convex optimization
    Gandy, Silvia
    Recht, Benjamin
    Yamada, Isao
    [J]. INVERSE PROBLEMS, 2011, 27 (02)