A High-Order Tensor Completion Algorithm Based on Fully-Connected Tensor Network Weighted Optimization

被引:0
|
作者
Yang, Peilin [1 ]
Huang, Yonghui [1 ]
Qiu, Yuning [1 ]
Sun, Weijun [1 ]
Zhou, Guoxu [1 ]
机构
[1] Guangdong Univ Technol, Sch Automat, Guangzhou 510006, Peoples R China
关键词
FCTN-WOPT; Tensor decomposition; Tensor completion; Deep learning; Gradient descent; RANK;
D O I
10.1007/978-3-031-18907-4_32
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Tensor completion aims at recovering missing data, and it is one of the popular concerns in deep learning and signal processing. Among the higher-order tensor decomposition algorithms, the recently proposed fully-connected tensor network decomposition (FCTN) algorithm is the most advanced. In this paper, by leveraging the superior expression of the fully-connected tensor network (FCTN) decomposition, we propose a new tensor completion method named the fully connected tensor network weighted optimization (FCTN-WOPT). The algorithm performs a composition of the completed tensor by initializing the factors from the FCTN decomposition. We build a loss function with the weight tensor, the completed tensor and the incomplete tensor together, and then update the completed tensor using the lbfgs gradient descent algorithm to reduce the spatial memory occupation and speed up iterations. Finally we test the completion with synthetic data and real data (both image data and video data) and the results show the advanced performance of our FCTN-WOPT when it is applied to higher-order tensor completion.
引用
收藏
页码:411 / 422
页数:12
相关论文
共 50 条
  • [41] T-Net: Parametrizing Fully Convolutional Nets with a Single High-Order Tensor
    Kossaifi, Jean
    Bulat, Adrian
    Tzimiropoulos, Georgios
    Pantic, Maja
    2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, : 7814 - 7823
  • [42] Infrared Dim and Small Target Detection Based on Superpixel Segmentation and Spatiotemporal Cluster 4D Fully-Connected Tensor Network Decomposition
    Wei, Wenyan
    Ma, Tao
    Li, Meihui
    Zuo, Haorui
    REMOTE SENSING, 2024, 16 (01)
  • [43] Nonconvex Robust High-Order Tensor Completion Using Randomized Low-Rank Approximation
    Qin, Wenjin
    Wang, Hailin
    Zhang, Feng
    Ma, Weijun
    Wang, Jianjun
    Huang, Tingwen
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2024, 33 : 2835 - 2850
  • [44] RIEMANNIAN OPTIMIZATION FOR HIGH-DIMENSIONAL TENSOR COMPLETION
    Steinlechner, Michael
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (05): : S461 - S484
  • [45] An Exploration of Optimization Algorithms for High Performance Tensor Completion
    Smith, Shaden
    Park, Jongsoo
    Karypis, George
    SC '16: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2016, : 359 - 371
  • [46] Limited memory BFGS method based on a high-order tensor model
    Biglari, Fahimeh
    Ebadian, Ali
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2015, 60 (02) : 413 - 422
  • [47] TENSOR-BASED NONLINEAR CLASSIFIER FOR HIGH-ORDER DATA ANALYSIS
    Makantasis, Konstantinos
    Doulamis, Anastasios
    Doulamis, Nikolaos
    Nikitakis, Antonis
    Voulodimos, Athanasios
    2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2018, : 2221 - 2225
  • [48] Limited memory BFGS method based on a high-order tensor model
    Fahimeh Biglari
    Ali Ebadian
    Computational Optimization and Applications, 2015, 60 : 413 - 422
  • [49] Adaptively robust high-order tensor factorization for low-rank tensor reconstruction☆
    Song, Zihao
    Chen, Yongyong
    Zhao, Weihua
    PATTERN RECOGNITION, 2025, 165
  • [50] A novel log-based tensor completion algorithm
    Geng J.
    Yan L.
    Liu Y.
    Geng, Juan (stgengjuan@heuet.edu.cn), 1600, International Information and Engineering Technology Association (25): : 153 - 163