Tensor completion using total variation and low-rank matrix factorization

被引：130
|
作者：
Ji, Teng-Yu [1 ]
Huang, Ting-Zhu [1 ]
Zhao, Xi-Le [1 ]
Ma, Tian-Hui [1 ]
Liu, Gang [1 ]
机构：
[1] Univ Elect Sci & Technol China, Sch Math Sci, Resrarch Ctr Image & Vis Comp, Chengdu 611731, Sichuan, Peoples R China
来源：
INFORMATION SCIENCES | 2016年 / 326卷
关键词：
Tensor completion; Total variation; Low-rank matrix factorization; Block coordinate descent; ALGORITHM;
D O I：
10.1016/j.ins.2015.07.049
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we study the problem of recovering a tensor with missing data. We propose a new model combining the total variation regularization and low-rank matrix factorization. A block coordinate decent (BCD) algorithm is developed to efficiently solve the proposed optimization model. We theoretically show that under some mild conditions, the algorithm converges to the coordinatewise minimizers. Experimental results are reported to demonstrate the effectiveness of the proposed model and the efficiency of the numerical scheme. (C) 2015 Elsevier Inc. All rights reserved.
引用
下载
收藏
页码：243 / 257
页数：15
相关论文
共 50 条
  • [41] Low-rank Matrix Completion using Alternating Minimization
    Jain, Prateek
    Netrapalli, Praneeth
    Sanghavi, Sujay
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 665 - 674
  • [42] LOW-RANK MATRIX COMPLETION WITH POISSON OBSERVATIONS VIA NUCLEAR NORM AND TOTAL VARIATION CONSTRAINTS
    Qiu, Duo
    Ng, Michael K.
    Zhang, Xiongjun
    JOURNAL OF COMPUTATIONAL MATHEMATICS, 2023,
  • [43] A fast tri-factorization method for low-rank matrix recovery and completion
    Liu, Yuanyuan
    Jiao, L. C.
    Shang, Fanhua
    PATTERN RECOGNITION, 2013, 46 (01) : 163 - 173
  • [44] Low-rank tensor completion by Riemannian optimization
    Kressner, Daniel
    Steinlechner, Michael
    Vandereycken, Bart
    BIT NUMERICAL MATHEMATICS, 2014, 54 (02) : 447 - 468
  • [45] CROSS: EFFICIENT LOW-RANK TENSOR COMPLETION
    Zhang, Anru
    ANNALS OF STATISTICS, 2019, 47 (02): : 936 - 964
  • [46] Robust Low-Rank Tensor Ring Completion
    Huang, Huyan
    Liu, Yipeng
    Long, Zhen
    Zhu, Ce
    IEEE TRANSACTIONS ON COMPUTATIONAL IMAGING, 2020, 6 : 1117 - 1126
  • [47] Low-rank tensor completion by Riemannian optimization
    Daniel Kressner
    Michael Steinlechner
    Bart Vandereycken
    BIT Numerical Mathematics, 2014, 54 : 447 - 468
  • [48] Optimal Low-Rank Tensor Tree Completion
    Li, Zihan
    Zhu, Ce
    Long, Zhen
    Liu, Yipeng
    2023 IEEE 25TH INTERNATIONAL WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING, MMSP, 2023,
  • [49] A dual framework for low-rank tensor completion
    Nimishakavi, Madhav
    Jawanpuria, Pratik
    Mishra, Bamdev
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [50] A Converse to Low-Rank Matrix Completion
    Pimentel-Alarcon, Daniel L.
    Nowak, Robert D.
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 96 - 100
12345