Tensor Train Factorization with Spatio-temporal Smoothness for Streaming Low-rank Tensor Completion

被引:1
|
作者
Yu, Gaohang [1 ]
Wan, Shaochun [1 ]
Ling, Chen [1 ]
Qi, Liqun [1 ,2 ,3 ]
Xu, Yanwei [2 ]
机构
[1] Hangzhou Dianzi Univ, Dept Math, Hangzhou 310018, Peoples R China
[2] Huawei Theory Res Lab, Hong Kong, Peoples R China
[3] Hong Kong Polytech Univ, Dept Appl Math, Hong Kong, Peoples R China
来源
FRONTIERS OF MATHEMATICS | 2024年 / 19卷 / 05期
基金
中国国家自然科学基金;
关键词
Internet traffic data recovery; tensor decomposition; tensor train; streaming low-rank tensor completion; TRAFFIC DATA; RECOVERY;
D O I
10.1007/s11464-021-0443-6
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Estimating the missing data from an incomplete measurement or observation plays an important role in the area of big data analytic, especially for some streaming data analysis such as video streaming recovery, traffic data analysis and network engineering. In this paper, by making full use of the potential spatio-temporal smoothness and inherent correlation properties in real-world tensor data, we present a low-rank Tensor Train (TT) factorization method for solving the 3-way streaming low-rank tensor completion problems. Extensive numerical experiments on color images, network traffic data and gray scale videos show that our model outperforms many existing state-of-the-art approaches in terms of achieving higher recovery accuracy.
引用
收藏
页码:933 / 959
页数:27
相关论文
共 50 条
  • [41] Robust Low-Rank Tensor Ring Completion
    Huang, Huyan
    Liu, Yipeng
    Long, Zhen
    Zhu, Ce
    IEEE TRANSACTIONS ON COMPUTATIONAL IMAGING, 2020, 6 : 1117 - 1126
  • [42] Low-rank tensor completion by Riemannian optimization
    Daniel Kressner
    Michael Steinlechner
    Bart Vandereycken
    BIT Numerical Mathematics, 2014, 54 : 447 - 468
  • [43] Low-rank tensor completion by Riemannian optimization
    Kressner, Daniel
    Steinlechner, Michael
    Vandereycken, Bart
    BIT NUMERICAL MATHEMATICS, 2014, 54 (02) : 447 - 468
  • [44] CROSS: EFFICIENT LOW-RANK TENSOR COMPLETION
    Zhang, Anru
    ANNALS OF STATISTICS, 2019, 47 (02): : 936 - 964
  • [45] 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,
  • [46] TWO HEURISTICS SOLVING LOW TENSOR TRAIN RANK TENSOR COMPLETION
    Tang, Yunfei
    Yang, Qingzhi
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2025, 21 (02) : 925 - 954
  • [47] 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
  • [48] TWO HEURISTICS SOLVING LOW TENSOR TRAIN RANK TENSOR COMPLETION
    Tang, Yunfei
    Yang, Qingzhi
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2025, 21 (02) : 925 - 954
  • [49] Imputation of Streaming Low-Rank Tensor Data
    Mardani, Morteza
    Mateos, Gonzalo
    Giannakis, Georgios B.
    2014 IEEE 8TH SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP (SAM), 2014, : 433 - 436
  • [50] Low-Rank Tensor Completion Based on Log-Det Rank Approximation and Matrix Factorization
    Shi, Chengfei
    Huang, Zhengdong
    Wan, Li
    Xiong, Tifan
    JOURNAL OF SCIENTIFIC COMPUTING, 2019, 80 (03) : 1888 - 1912