Abstract
Recently, low-rank tensor completion has attracted increasing attention in recovering incomplete tensor whose elements are missing. The basic assumption is that the underlying tensor is a low-rank tensor, and therefore tensor nuclear norm minimization can be applied to recover such tensor. By taking color images as third-order tensors, it has been shown that these tensors are not necessary to be low-rank. The main aim of this paper is to propose and develop a weighted tensor factorization method for low-rank tensor completion. The main idea is to determine a suitable weight tensor such that the multiplication of the weight tensor to the underlying tensor can be low-rank or can be factorized into a product of low-rank tensors. Fast iterative minimization method can be designed to solve for the weight tensor and the underlying tensor very efficiently. We make use of color images as examples to illustrate the proposed approach. A series of experiments are conducted on various incomplete color images to demonstrate the superiority of our proposed low-rank tensor factorization method by comparing with the state-of-the-art methods in color image completion performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.