A high-order tensor completion algorithm based on Fully-Connected Tensor Network weighted optimization
Not on the map. Why?
Abstract (arXiv)
Tensor completion aimes 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 optization(FCTN-WOPT). The algorithm performs a composition of the completed tensor by initialising 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.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 24 references that are in the map. First posted on arXiv 4 Apr 2022.
Builds on
8 of 24 references.
References · 8
- 2016Tensor Ring Decompositioncited by 125
- 2017Efficient Low Rank Tensor Ring Completioncited by 45
- 2018Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completioncited by 42
- 2014On Tensor Completion via Nuclear Norm Minimizationcited by 32
- 2019Tensor-Ring Nuclear Norm Minimization and Application for Visual Data Completioncited by 12
- 2020Hyperspectral Super-Resolution via Coupled Tensor Ring Factorizationcited by 12
- 2013Rank regularization and Bayesian inference for tensor completion and extrapolationcited by 8
- 2021Fully-Connected Tensor Network Decomposition for Robust Tensor Completion Problemcited by 5
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.
2 papers.
- 2022Latent Matrices for Tensor Network Decomposition and to Tensor Completioncited by 0
- 2025tenSVD algorithm for compressioncited by 0
- 2025tenSVD algorithm for compression27 May 2025
- 2022Latent Matrices for Tensor Network Decomposition and to Tensor Completion7 Oct 2022