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

03/17/2023
by   Zheng Tan, et al.
0

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.

READ FULL TEXT
research
04/23/2019

Non-convex Penalty for Tensor Completion and Robust PCA

In this paper, we propose a novel non-convex tensor rank surrogate funct...
research
01/09/2020

Coupled Tensor Completion via Low-rank Tensor Ring

The coupled tensor decomposition aims to reveal the latent data structur...
research
03/19/2020

HOSVD-Based Algorithm for Weighted Tensor Completion

Matrix completion, the problem of completing missing entries in a data m...
research
12/11/2019

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

Low-rank tensor decomposition and completion have attracted significant ...
research
09/13/2021

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...
research
06/05/2023

Under-Counted Tensor Completion with Neural Incorporation of Attributes

Systematic under-counting effects are observed in data collected across ...
research
05/16/2023

Image Reconstruction using Superpixel Clustering and Tensor Completion

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

Please sign up or login with your details

Forgot password? Click here to reset