DeepAI AI Chat
Log In Sign Up

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

by   Zheng Tan, et al.

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.


Non-convex Penalty for Tensor Completion and Robust PCA

In this paper, we propose a novel non-convex tensor rank surrogate funct...

Coupled Tensor Completion via Low-rank Tensor Ring

The coupled tensor decomposition aims to reveal the latent data structur...

HOSVD-Based Algorithm for Weighted Tensor Completion

Matrix completion, the problem of completing missing entries in a data m...

Tensor Completion for Weakly-dependent Data on Graph for Metro Passenger Flow Prediction

Low-rank tensor decomposition and completion have attracted significant ...

Effective Tensor Completion via Element-wise Weighted Low-rank Tensor Train with Overlapping Ket Augmentation

In recent years, there have been an increasing number of applications of...

Image Reconstruction using Superpixel Clustering and Tensor Completion

This paper presents a pixel selection method for compact image represent...

Weighted Tensor Completion for Time-Series Causal Information

Marginal Structural Models (MSM) Robins00 are the most popular models fo...