Litcius/Paper detail

Robust tensor completion using transformed tensor singular value decomposition

Guang‐Jing Song, Michael K. Ng, Xiongjun Zhang

2020Numerical Linear Algebra with Applications219 citationsDOI

Abstract

Summary In this article, 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 peak signal‐to‐noise ratio than that by using Fourier transform and other robust tensor completion methods.

Topics & Concepts

MathematicsSingular value decompositionTensor (intrinsic definition)Cartesian tensorSymmetric tensorTensor contractionMatrix decompositionDiscrete Fourier transform (general)Tensor product of Hilbert spacesTensor densityFourier transformMathematical analysisFractional Fourier transformTensor fieldAlgorithmTensor productPure mathematicsFourier analysisExact solutions in general relativityPhysicsEigenvalues and eigenvectorsQuantum mechanicsSparse and Compressive Sensing TechniquesTensor decomposition and applicationsImage and Signal Denoising Methods
Robust tensor completion using transformed tensor singular value decomposition | Litcius