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 条
  • [31] CROSS: EFFICIENT LOW-RANK TENSOR COMPLETION
    Zhang, Anru
    [J]. ANNALS OF STATISTICS, 2019, 47 (02): : 936 - 964
  • [32] Optimal Low-Rank Tensor Tree Completion
    Li, Zihan
    Zhu, Ce
    Long, Zhen
    Liu, Yipeng
    [J]. 2023 IEEE 25TH INTERNATIONAL WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING, MMSP, 2023,
  • [33] A dual framework for low-rank tensor completion
    Nimishakavi, Madhav
    Jawanpuria, Pratik
    Mishra, Bamdev
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [34] Low-Rank Tensor Completion Based on Log-Det Rank Approximation and Matrix Factorization
    Shi, Chengfei
    Huang, Zhengdong
    Wan, Li
    Xiong, Tifan
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2019, 80 (03) : 1888 - 1912
  • [35] Low-Rank Tensor Completion Based on Log-Det Rank Approximation and Matrix Factorization
    Chengfei Shi
    Zhengdong Huang
    Li Wan
    Tifan Xiong
    [J]. Journal of Scientific Computing, 2019, 80 : 1888 - 1912
  • [36] Low-Rank Tensor Completion by Sum of Tensor Nuclear Norm Minimization
    Su, Yaru
    Wu, Xiaohui
    Liu, Wenxi
    [J]. IEEE ACCESS, 2019, 7 : 134943 - 134953
  • [37] Robust Low-Rank Tensor Completion Based on Tensor Ring Rank via,&epsilon
    Li, Xiao Peng
    So, Hing Cheung
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 : 3685 - 3698
  • [38] On the equivalence between low-rank matrix completion and tensor rank
    Derksen, Harm
    [J]. LINEAR & MULTILINEAR ALGEBRA, 2018, 66 (04): : 645 - 667
  • [39] A Riemannian trust-region method for low-rank tensor completion
    Heidel, Gennadij
    Schulz, Volker
    [J]. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2018, 25 (06)
  • [40] Nonnegative low-rank tensor completion method for spatiotemporal traffic data
    Zhao, Yongmei
    Tuo, Mingfu
    Zhang, Hongmei
    Zhang, Han
    Wu, Jiangnan
    Gao, Fengyin
    [J]. MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 83 (22) : 61761 - 61776