Low-rank tensor completion with a new tensor nuclear norm induced by invertible linear transforms

Publication Type:
Conference Proceeding
Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2019, 2019-June, pp. 5989-5997
Issue Date:
Filename Description Size
08953215.pdfPublished version1.6 MB
Adobe PDF
Full metadata record
© 2019 IEEE. This work studies the low-rank tensor completion problem, which aims to exactly recover a low-rank tensor from partially observed entries. Our model is inspired by the recently proposed tensor-tensor product (t-product) based on any invertible linear transforms. When the linear transforms satisfy certain conditions, we deduce the new tensor tubal rank, tensor spectral norm, and tensor nuclear norm. Equipped with the tensor nuclear norm, we then solve the tensor completion problem by solving a convex program and provide the theoretical bound for the exact recovery under certain tensor incoherence conditions. The achieved sampling complexity is order-wise optimal. Our model and result greatly extend existing results in the low-rank matrix and tensor completion. Numerical experiments verify our results and the application on image recovery demonstrates the superiority of our method.
Please use this identifier to cite or link to this item: