Algoritmi za reševanje tenzorskih napolnitev in njihova uporaba za rekonstrukcijo slik

The tensor completion problem asks to complete a partially known tensor such that the rank of the completion is the smallest possible. In this thesis, we present the mathematical background of six algorithms used to solve this problem (HaLRTC, T-SVD, WangLRTC, TNN, TNN_DCT, SPC). We implement and compare them in the area of image reconstruction. Focusing on the area of image reconstruction, we study the robustness of the algorithms, quality of the reconstruction and convergence times. To obtain good performance, we also employ image preprocessing techniques to decompose the image into smaller low-rank subimages, known as patches.