Tensor completion by multi-rank via unitary transformation
From MaRDI portal
Publication:6042617
Abstract: One of the key problems in tensor completion is the number of uniformly random sample entries required for recovery guarantee. The main aim of this paper is to study third-order tensor completion based on transformed tensor singular value decomposition, and provide a bound on the number of required sample entries. Our approach is to make use of the multi-rank of the underlying tensor instead of its tubal rank in the bound. In numerical experiments on synthetic and imaging data sets, we demonstrate the effectiveness of our proposed bound for the number of sample entries. Moreover, our theoretical results are valid to any unitary transformation applied to -dimension under transformed tensor singular value decomposition.
Recommendations
- Cross: efficient low-rank tensor completion
- On tensor completion via nuclear norm minimization
- Spectral algorithms for tensor completion
- One-bit tensor completion via transformed tensor singular value decomposition
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
Cites work
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- A simpler approach to matrix completion
- An order-\(p\) tensor factorization with applications in imaging
- Exact matrix completion via convex optimization
- Exact Tensor Completion Using t-SVD
- Factorization strategies for third-order tensors
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Hankel matrix rank minimization with applications to system identification and realization
- scientific article; zbMATH DE number 6474942 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- Incoherence-Optimal Matrix Completion
- Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Low rank tensor recovery via iterative hard thresholding
- Nonlocal robust tensor recovery with nonconvex regularization
- On polynomial time methods for exact low-rank tensor completion
- On tensor completion via nuclear norm minimization
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Robust principal component analysis?
- Robust tensor completion using transformed tensor singular value decomposition
- Spectral algorithms for tensor completion
- Spectral Unmixing via Data-Guided Sparsity
- Tensor Decompositions and Applications
- Tensor Regression Using Low-Rank and Sparse Tucker Decompositions
- Tensor-tensor products with invertible linear transforms
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging
Cited in
(9)- Unitary dilation approach to contractive matrix completion.
- One-bit tensor completion via transformed tensor singular value decomposition
- Robust tensor completion using transformed tensor singular value decomposition
- Scaled Coupled Norms and Coupled Higher-Order Tensor Completion
- Tensor factorization via transformed tensor-tensor product for image alignment
- A novel \(\ell_0\) minimization framework of tensor tubal rank and its multi-dimensional image completion application
- Eigenvalues of quaternion tensors: properties, algorithms and applications
- Grouped tensor low-rank representation for multi-dimensional image recovery
- Poisson tensor completion via nonconvex regularization and nonlocal self-similarity for multi-dimensional image recovery
This page was built for publication: Tensor completion by multi-rank via unitary transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042617)
