Smooth PARAFAC Decomposition for Tensor Completion
From MaRDI portal
Abstract: In recent years, low-rank based tensor completion, which is a higher-order extension of matrix completion, has received considerable attention. However, the low-rank assumption is not sufficient for the recovery of visual data, such as color and 3D images, where the ratio of missing data is extremely high. In this paper, we consider "smoothness" constraints as well as low-rank approximations, and propose an efficient algorithm for performing tensor completion that is particularly powerful regarding visual data. The proposed method admits significant advantages, owing to the integration of smooth PARAFAC decomposition for incomplete tensors and the efficient selection of models in order to minimize the tensor rank. Thus, our proposed method is termed as "smooth PARAFAC tensor completion (SPC)." In order to impose the smoothness constraints, we employ two strategies, total variation (SPC-TV) and quadratic variation (SPC-QV), and invoke the corresponding algorithms for model learning. Extensive experimental evaluations on both synthetic and real-world visual data illustrate the significant improvements of our method, in terms of both prediction performance and efficiency, compared with many state-of-the-art tensor completion methods.
Cited in
(37)- Enhancing matrix completion using a modified second-order total variation
- Block tensor train decomposition for missing data estimation
- Tensor train rank minimization with nonlocal self-similarity for tensor completion
- A general framework for tensor screening through smoothing
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion
- Nonconvex tensor rank minimization and its applications to tensor recovery
- Tensor completion based on triple tubal nuclear norm
- Majorized proximal alternating imputation for regularized rank constrained matrix completion
- Low-rank tensor completion via smooth matrix factorization
- An approximation method of CP rank for third-order tensor completion
- Tensor Completion via Gaussian Process--Based Initialization
- New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
- An accelerated tensorial double proximal gradient method for total variation regularization problem
- A generalized non-convex method for robust tensor completion
- An image inpainting algorithm using exemplar matching and low-rank sparse prior
- Variational Bayesian inference for CP tensor completion with subspace information
- Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
- Online subspace learning and imputation by tensor-ring decomposition
- Imbalanced low-rank tensor completion via latent matrix factorization
- Distributed neural tensor completion for network monitoring data recovery
- Mixed norm regularized models for low-rank tensor completion
- Super Resolution for Multi-Sources Image Stream Data Using Smooth and Sparse Tensor Completion and Its Applications in Data Acquisition of Additive Manufacturing
- High-order tensor nuclear norm with multiway delay-embedding transform for color image recovery
- A novel two-stage robust tensor completion method via enhanced global recovery and local patch-level refinement
- Smooth and Probabilistic PARAFAC Model with Auxiliary Covariates
- Accurate regularized Tucker decomposition for image restoration
- A fast correction approach to tensor robust principal component analysis
- Nonnegative tensor decomposition via collaborative neurodynamic optimization
- A non-convex regularization fusing low-rankness and smoothness for tensor recovery
- Latent functional PARAFAC for modeling multidimensional longitudinal data
- Efficient quaternion tensor completion via \(L_{2,1}\)-norm and QR decomposition
- A non-convex tensor rpca model with TL1 penalty for image restoration
- Unified quadratic regularization for structured CP decomposition
- Robust low-rank tensor completion based on M-product with weighted correlated total variation and sparse regularization
- Hypergraph regularized and low-rank enhanced Tucker decomposition for image restoration
- Tensor train rank minimization with hybrid smoothness regularization for visual data recovery
This page was built for publication: Smooth PARAFAC Decomposition for Tensor Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620995)
