Robust Tensor Completion Using Transformed Tensor SVD

07/02/2019
by   Guangjing Song, et al.
3

In this paper, we study robust tensor completion by using transformed tensor singular value decomposition (SVD), which employs unitary transform matrices instead of discrete Fourier transform matrix that is used in the traditional tensor SVD. The main motivation is that a lower tubal rank tensor can be obtained by using other unitary transform matrices than that by using discrete Fourier transform matrix. This would be more effective for robust tensor completion. Experimental results for hyperspectral, video and face datasets have shown that the recovery performance for the robust tensor completion problem by using transformed tensor SVD is better in PSNR than that by using Fourier transform and other robust tensor completion methods.

READ FULL TEXT

page 11

page 12

page 14

research
09/16/2019

Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completion

The main aim of this paper is to develop a framelet representation of th...
research
02/08/2019

A Fast Algorithm for Cosine Transform Based Tensor Singular Value Decomposition

Recently, there has been a lot of research into tensor singular value de...
research
03/29/2021

An Orthogonal Equivalence Theorem for Third Order Tensors

In 2011, Kilmer and Martin proposed tensor singular value decomposition ...
research
09/02/2022

Explicit calculation of singular integrals of tensorial polyadic kernels

The Riesz transform of u : 𝒮(ℝ^n) →𝒮'(ℝ^n) is defined as a convolution b...
research
02/15/2022

Radial-recombination for rigid rotational alignment of images and volumes

A common task in single particle electron cryomicroscopy (cryo-EM) is th...
research
10/03/2019

Quantum tensor singular value decomposition with applications to recommendation systems

In this paper, we present a quantum singular value decomposition algorit...

Please sign up or login with your details

Forgot password? Click here to reset