Abstract

Tensor completion aims to recover the missing entries in multi-way data. Based on the low-rank assumption, many methods according to different tensor decomposition frameworks have been developed for image recovery. Recently emerging tensor singular value decomposition (t-SVD) can better characterize the low-rank structure for 3rd-order data, but it suffers from rotation sensitivity and demands for a higher-order version. As the high-order extension of matrix SVD, Tucker decomposition tries to extract low-rank information along each mode. Inspired by this, we extend t-SVD into an improved one called multi-mode tensor singular value decomposition, which can explore the low-rank information along different modes. Based on it, a convex multi-dimensional square model for tensor completion is proposed and solved by the classic alternating direction method of multipliers. Experimental results on color image and multispectral image completion demonstrate the superior recovery accuracy and competitive CPU time of our method compared with existing state-of-the-art ones.

Full Text
Paper version not known

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 call

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.