Non-convex approaches for low-rank tensor completion under tubal sampling

Zheng Tan, Longxiu Huang, HanQin Cai, Yifei Lou
3/17/2023
cs.LGcs.CVmath.NA

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Tensor completion is an important problem in modern data analysis. In this work, we investigate a specific sampling strategy, referred to as tubal sampling. We propose two novel non-convex tensor completion frameworks that are easy to implement, named tensor $L_1$-$L_2$ (TL12) and tensor completion via CUR (TCCUR). We test the efficiency of both methods on synthetic data and a color image inpainting problem. Empirical results reveal a trade-off between the accuracy and time efficiency of these two methods in a low sampling ratio. Each of them outperforms some classical completion methods in at least one aspect.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{tan2023nonconvex,
  title  = {Non-convex approaches for low-rank tensor completion under tubal sampling},
  author = {Zheng Tan and Longxiu Huang and HanQin Cai and Yifei Lou},
  year   = {2023},
  eprint = {2303.12721},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.12721v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.12721.svg)](https://codeofpaper.com/paper/2303.12721)

Discussion