Papers › Cross Tensor Approximation for Image and Video Completion

Cross Tensor Approximation for Image and Video Completion

13 Jul 2022arXiv:2207.06072links table onlyarchive 2025-07-28

Salman Ahmadi-Asl, Maame Gyamfua Asante-Mensah, Andrzej Cichocki, Anh-Huy Phan, Ivan Oseledets, Jun Wang

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

This paper proposes a general framework to use the cross tensor approximation or tensor ColUmn-Row (CUR) approximation for reconstructing incomplete images and videos. The key importance of the new algorithms is their simplicity and ease of implementation with low computational complexity. For the case of data tensors with 1) structural missing components or 2) a high missing rate, we propose an efficient smooth tensor CUR algorithms which first make the sampled fibers smooth and then apply the proposed CUR algorithms. The numerical experiments show the significant benefit of this smoothing procedure. The main contribution of this paper is to develop/investigate improved multistage CUR algorithms with filtering (smoothing ) preprocessing for tensor completion. The second contribution is a detailed comparison of the performance of image recovery for four different CUR strategies via extensive computer simulations. Our simulations clearly indicated that the proposed algorithms are much faster than most of the existing state-of-the-art algorithms developed for tensor completion, while performance is comparable and often even better. Furthermore, we will provide in GitHub the MATLAB codes which can be used for various applications. Moreover, to our best knowledge, the CUR (cross approximation) algorithms have not been investigated nor compared till now for image and video completion.

PaperPDFCode

Code

salmanahmadi-asl/cross_tensor_completion officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections