A Weighted Tensor Factorization Method for Low-rank Tensor Completion

被引:0
|
作者
Cheng, Miaomiao [1 ]
Jing, Liping [1 ]
Ng, Michael K. [2 ]
机构
[1] Beijing Jiaotong Univ, Beijing Key Lab Traff Data Anal & Min, Beijing 100044, Peoples R China
[2] Univ Hong Kong, Dept Math, Pokfulam, Hong Kong, Peoples R China
基金
中国国家自然科学基金; 北京市自然科学基金;
关键词
Tensor Factorization; Tensor Completion; Low-rank;
D O I
10.1109/BigMM.2019.00017
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, low-rank tensor completion has attracted increasing attention in recovering incomplete tensor whose elements are missing. The basic assumption is that the underlying tensor is a low-rank tensor, and therefore tensor nuclear norm minimization can be applied to recover such tensor. By taking color images as third-order tensors, it has been shown that these tensors are not necessary to be low-rank. The main aim of this paper is to propose and develop a weighted tensor factorization method for low-rank tensor completion. The main idea is to determine a suitable weight tensor such that the multiplication of the weight tensor to the underlying tensor can be low-rank or can be factorized into a product of low-rank tensors. Fast iterative minimization method can be designed to solve for the weight tensor and the underlying tensor very efficiently. We make use of color images as examples to illustrate the proposed approach. A series of experiments are conducted on various incomplete color images to demonstrate the superiority of our proposed low-rank tensor factorization method by comparing with the state-of-the-art methods in color image completion performance.
引用
收藏
页码:30 / 38
页数:9
相关论文
共 50 条
  • [21] Tensor Train Factorization with Spatio-temporal Smoothness for Streaming Low-rank Tensor Completion
    Yu, Gaohang
    Wan, Shaochun
    Ling, Chen
    Qi, Liqun
    Xu, Yanwei
    [J]. FRONTIERS OF MATHEMATICS, 2024, 19 (05): : 933 - 959
  • [22] Iterative tensor eigen rank minimization for low-rank tensor completion
    Su, Liyu
    Liu, Jing
    Tian, Xiaoqing
    Huang, Kaiyu
    Tan, Shuncheng
    [J]. INFORMATION SCIENCES, 2022, 616 : 303 - 329
  • [23] Noisy Tensor Completion via Low-Rank Tensor Ring
    Qiu, Yuning
    Zhou, Guoxu
    Zhao, Qibin
    Xie, Shengli
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (01) : 1127 - 1141
  • [24] Auto-weighted robust low-rank tensor completion via tensor-train
    Chen, Chuan
    Wu, Zhe-Bin
    Chen, Zi-Tai
    Zheng, Zi-Bin
    Zhang, Xiong-Jun
    [J]. INFORMATION SCIENCES, 2021, 567 : 100 - 115
  • [25] Riemannian conjugate gradient method for low-rank tensor completion
    Shan-Qi Duan
    Xue-Feng Duan
    Chun-Mei Li
    Jiao-Fen Li
    [J]. Advances in Computational Mathematics, 2023, 49
  • [26] Riemannian conjugate gradient method for low-rank tensor completion
    Duan, Shan-Qi
    Duan, Xue-Feng
    Li, Chun-Mei
    Li, Jiao-Fen
    [J]. ADVANCES IN COMPUTATIONAL MATHEMATICS, 2023, 49 (03)
  • [27] A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
    Zhang, Xiongjun
    Ng, Michael K.
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2019, 12 (02): : 1231 - 1273
  • [28] Low-rank tensor completion by Riemannian optimization
    Daniel Kressner
    Michael Steinlechner
    Bart Vandereycken
    [J]. BIT Numerical Mathematics, 2014, 54 : 447 - 468
  • [29] Robust Low-Rank Tensor Ring Completion
    Huang, Huyan
    Liu, Yipeng
    Long, Zhen
    Zhu, Ce
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL IMAGING, 2020, 6 : 1117 - 1126
  • [30] Low-rank tensor completion by Riemannian optimization
    Kressner, Daniel
    Steinlechner, Michael
    Vandereycken, Bart
    [J]. BIT NUMERICAL MATHEMATICS, 2014, 54 (02) : 447 - 468