Abstract
In this paper we consider the problem of recovering an N-dimensional data from a subset of its observed entries. We provide a generalization for the smooth Shcatten-p rank approximation function in [1] to the N-dimensional space. In addition, we derive an optimization algorithm using the Augmented Lagrangian Multiplier in the N-dimensional space to solve the tensor completion problem. We compare the performance of our algorithm to state-of-the-art tensor completion algorithms using different color images and video sequences. Our experimental results showed that the proposed algorithm converges faster (approximately half the execution time), and at the same time it achieves comparable performance to state-of-the-art tensor completion algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
