Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion

10/01/2020 ∙ by Chenjian Pan, et al. ∙ 0

Tensor completion refers to the task of estimating the missing data from an incomplete measurement or observation, which is a core problem frequently arising from the areas of big data analysis, computer vision, and network engineering. Due to the multidimensional nature of high-order tensors, the matrix approaches, e.g., matrix factorization and direct matricization of tensors, are often not ideal for tensor completion and recovery. Exploiting the potential periodicity and inherent correlation properties appeared in real-world tensor data, in this paper, we shall incorporate the low-rank and sparse regularization technique to enhance Tucker decomposition for tensor completion. A series of computational experiments on real-world datasets, including internet traffic data, color images, and face recognition, show that our model performs better than many existing state-of-the-art matricization and tensorization approaches in terms of achieving higher recovery accuracy.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 10

page 12

page 13

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.