Search Results for author:
Found 2 papers, 0 papers with code
Fully-Connected Tensor Network Decomposition for Robust Tensor Completion Problem
In this paper, by leveraging the superior expression of the fully-connected tensor network (FCTN) decomposition, we propose a $\textbf{FCTN}$-based $\textbf{r}$obust $\textbf{c}$onvex optimization model (RC-FCTN) for the RTC problem.
Tensor Completion by Multi-Rank via Unitary Transformation
The main aim of this paper is to study $n_1 \times n_2 \times n_3$ third-order tensor completion based on transformed tensor singular value decomposition, and provide a bound on the number of required sample entries.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
