A high-order tensor completion algorithm based on Fully-Connected Tensor Network weighted optimization
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Tensor DecompositionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Latent Matrices for Tensor Network Decomposition and to Tensor Completion
The prevalent fully-connected tensor network (FCTN) has achieved excellent success to compress data. However, the FCTN decomposition suffers from slow computational speed when facing higher-order and large-scale data. Na…
Tensor DecompositionConcatenated image completion via tensor augmentation and completion
This paper proposes a novel framework called concatenated image completion via tensor augmentation and completion (ICTAC), which recovers missing entries of color images with high accuracy. Typical images are second- or …
Completion of High Order Tensor Data with Missing Entries via Tensor-train Decomposition
In this paper, we aim at the completion problem of high order tensor data with missing entries. The existing tensor factorization and completion methods suffer from the curse of dimensionality when the order of tensor N>…
High-order Tensor Completion for Data Recovery via Sparse Tensor-train Optimization
In this paper, we aim at the problem of tensor data completion. Tensor-train decomposition is adopted because of its powerful representation ability and linear scalability to tensor order. We propose an algorithm named S…
Vocal Bursts Intensity PredictionHigh-dimension Tensor Completion via Gradient-based Optimization Under Tensor-train Format
Tensor train (TT) decomposition has drawn people's attention due to its powerful representation ability and performance stability in high-order tensors. In this paper, we propose a novel approach to recover the missing e…
Vocal Bursts Intensity Prediction