Abstract
In this paper, we study the low-tubal-rank tensor completion problem, i.e., the problem of recovering a third-order tensor by observing a subset of its entries, when these entries are selected uniformly at random. We propose a mathematical analysis of an extension of the Bürer-Monteiro factorisation approach to this problem. We then illustrate the use of the Bürer-Monteiro approach on a challenging OCT reconstruction problem on both synthetic and real world data, using an alternating minimisation algorithm.
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.