|
چکیده
|
One of the new methods of data recovery is the tensor completion problem. Since most of the data such as images and videos and numerical data are in the form of tensors, tensor completion methods for information recovery are of great importance and attractiveness in this field. The purpose of low-rank tensor completion is to recover lost information so that the tensor rank is minimized. So far, various methods have been proposed to solve the tensor completion problem, among which methods based on the nuclear norm are of particular importance due to their convexity. However, methods based on nuclear norm have a high computational complexity, since the calculation of the singular value decomposition in each iteration of the algorithm is needed. For this reason, in order to reduce the computational cost and increase the convergence speed of the answer, the fast tri-factorization method of matrix completion cen be used. In this work, we generalize the fast tri-factorization method of matrix completion to the high order arrays.
|