Author:
Mohaoui S., ,El Qate K.,Hakim A.,Raghay S., , ,
Abstract
In this work, we study the tensor completion problem in which the main point is to predict the missing values in visual data. To greatly benefit from the smoothness structure and edge-preserving property in visual images, we suggest a tensor completion model that seeks gradient sparsity via the l0-norm. The proposal combines the low-rank matrix factorization which guarantees the low-rankness property and the nonconvex total variation (TV). We present several experiments to demonstrate the performance of our model compared with popular tensor completion methods in terms of visual and quantitative measures.
Publisher
Lviv Polytechnic National University
Subject
Computational Theory and Mathematics,Computational Mathematics
Reference22 articles.
1. Kolda T. G., Bader B. W. Tensor decompositions and applications. SIAM review. 51 (3), 455-500 (2009).
2. Xu Y., Hao R., Yin W., Su Z. Parallel matrix factorization for low-rank tensor completion. Preprint arXiv:1312.1254 (2013).
3. He W., Zhang H., Zhang L., Shen H. Total-variation-regularized low-rank matrix factorization for hyperspectral image restoration. IEEE transactions on geoscience and remote sensing. 54 (1), 178-188 (2015).
4. Tensor completion using total variation and low-rank matrix factorization;T.-Y.;Information Sciences,2016
5. Jiang T.-X., Huang T.-Z., Zhao X.-L., Ji T.-Y., Deng L.-J. Matrix factorization for low-rank tensor completion using framelet prior. Information Sciences. 436-437, 403-417 (2018).