Exact Tensor Completion Using t-SVD
From MaRDI portal
Abstract: In this paper we focus on the problem of completion of multidimensional arrays (also referred to as tensors) from limited sampling. Our approach is based on a recently proposed tensor-Singular Value Decomposition (t-SVD) [1]. Using this factorization one can derive notion of tensor rank, referred to as the tensor tubal rank, which has optimality properties similar to that of matrix rank derived from SVD. As shown in [2] some multidimensional data, such as panning video sequences exhibit low tensor tubal rank and we look at the problem of completing such data under random sampling of the data cube. We show that by solving a convex optimization problem, which minimizes the tensor nuclear norm obtained as the convex relaxation of tensor tubal rank, one can guarantee recovery with overwhelming probability as long as samples in proportion to the degrees of freedom in t-SVD are observed. In this sense our results are order-wise optimal. The conditions under which this result holds are very similar to the incoherency conditions for the matrix completion, albeit we define incoherency under the algebraic set-up of t-SVD. We show the performance of the algorithm on some real data sets and compare it with other existing approaches based on tensor flattening and Tucker decomposition.
Cited in
(only showing first 100 items - show all)- Exact matrix completion based on low rank Hankel structure in the Fourier domain
- Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- Tensor train rank minimization with nonlocal self-similarity for tensor completion
- The nonconvex tensor robust principal component analysis approximation model via the weighted _p-norm regularization
- Tensor Q-rank: new data dependent definition of tensor rank
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- Robust tensor recovery with nonconvex and nonsmooth regularization
- Hot-SVD: higher order t-singular value decomposition for tensors based on tensor-tensor product
- Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD
- Randomized Kaczmarz for tensor linear systems
- T-square tensors. I: Inequalities
- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography
- T-product tensors. II: Tail bounds for sums of random T-product tensors
- Regularized high dimension low tubal-rank tensor regression
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- An efficient algorithm for computing the approximate t-URV and its applications
- An orthogonal equivalence theorem for third order tensors
- Video deraining via nonlocal low-rank regularization
- Generalized tensor function via the tensor singular value decomposition based on the T-product
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data
- Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery
- Nonconvex tensor rank minimization and its applications to tensor recovery
- One-bit tensor completion via transformed tensor singular value decomposition
- Low-rank tensor train for tensor robust principal component analysis
- Tensor completion based on triple tubal nuclear norm
- Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm
- RIP-based performance guarantee for low-tubal-rank tensor recovery
- Tensor neural network models for tensor singular value decompositions
- Low-rank tensor completion via smooth matrix factorization
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- Robust low transformed multi-rank tensor methods for image alignment
- An approximation method of CP rank for third-order tensor completion
- Continuity, differentiability and semismoothness of generalized tensor functions
- Quantum context-aware recommendation systems based on tensor singular value decomposition
- A fixed point iterative method for third-order tensor linear complementarity problems
- Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
- An Adaptive Correction Approach for Tensor Completion
- Near-optimal sample complexity for convex tensor completion
- Adaptive singular value shrinkage estimate for low rank tensor denoising
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
- Nonlocal robust tensor recovery with nonconvex regularization
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
- Generalized T-product tensor Bernstein bounds
- Tensor completion by multi-rank via unitary transformation
- Low-rank tensor data reconstruction and denoising via ADMM: algorithm and convergence analysis
- Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches
- An efficient randomized fixed-precision algorithm for tensor singular value decomposition
- Approximation strategy based on the T-product for third-order quaternion tensors with application to color video compression
- Low tubal rank tensor completion based on singular value factors
- Nonsymmetric Algebraic Riccati Equations under the Tensor Product
- An accelerated tensorial double proximal gradient method for total variation regularization problem
- Convergence analysis of iterative methods for computing the T-pseudoinverse of complete full-rank third-order tensors based on the T-product
- Iterative tensor eigen rank minimization for low-rank tensor completion
- Tensor completion via multi-directional partial tensor nuclear norm with total variation regularization
- Robust low-rank tensor completion via new regularized model with approximate SVD
- Riemannian conjugate gradient method for low-rank tensor completion
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- Low-tubal-rank tensor completion via local and nonlocal knowledge
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- The new Krylov subspace methods for solving tensor equations via \(T\)-product
- Optimized and federated soft-impute for privacy-preserving tensor completion in cyber-physical-social systems
- Exponential family tensor completion with auxiliary information
- Tensor denoising via dual Schatten norms
- Mixed norm regularized models for low-rank tensor completion
- An accelerated proximal gradient algorithm for Hankel tensor completion
- Improved quaternion robust principal component analysis for color image recovery
- TIHN: tensor improved huber norm for low-rank tensor recovery
- Block-diagonalization of quaternion circulant matrices with applications
- Two-sided randomized algorithms for approximate \(K\)-term t-SVD
- Block diagonalization of block circulant quaternion matrices and the fast calculation for T-product of quaternion tensors
- Quaternion tensor left ring decomposition and application for color image inpainting
- Regularized and structured tensor total least squares methods with applications
- High-dimensional regularized additive matrix autoregressive model
- A regularized low tubal-rank model for high-dimensional time series data
- Data-driven model order reduction via T-SVD
- Two heuristics solving low tensor train rank tensor completion
- Importance-aware nonlocal tensor nuclear norm for high-dimensional image recovery
- Block matrix and tensor randomized Kaczmarz methods for linear feasibility problems
- Tensor low-tubal-rank and sparse representations via dual-learnable transforms for multidimensional image recovery
- High-order tensor nuclear norm with multiway delay-embedding transform for color image recovery
- Diagonalization of two quaternion tensors with applications
- Low rank tensor completion algorithms based on non-convex L_*-L_F optimization
- Riemannian accelerated spectral conjugate gradient method for the tensor completion arising in the color image restoration
- A robust tensor wheel decomposition-based regularization method for tensor completion problem
- Low-rank tensor recovery based on nonconvex logarithmic regularization factor
- Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy
- Low-rank tensor completion with non-local self-similarity and multidimensional learnable transforms
- Accurate regularized Tucker decomposition for image restoration
- Enhancing artificial neural network learning efficiency through singular value decomposition for solving partial differential equations
- PALADIN: a novel plug-and-play 3D CS-MRI reconstruction method
- Adaptive sampling with tensor leverage scores for exact low-rank third-order tensor completion
- A fast correction approach to tensor robust principal component analysis
- Robust tensor completion from uniformly dithered one-bit observations
- Bilateral tensor low-rank representation for insufficient observed samples in multidimensional image clustering and recovery
- An optimization approach for transformed low tubal rank of third-order tensors
- Randomized iterative methods for tensor regression under the t-product
- Robust completion for rank-1 tensors with noises
- Low-Rank Tensor Completion using Tensor Train Decomposition via Riemannian Optimization on the Quotient Geometry
This page was built for publication: Exact Tensor Completion Using t-SVD
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620681)
