Smooth PARAFAC Decomposition for Tensor Completion

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.

13 pages, 9 figures

References in corpus (2)

• The Physics of Compressive Sensing and the Gradient-Based Recovery Algorithms
• Optimal Low-Rank Tensor Recovery from Separable Measurements: Four Contractions Suffice

Cited by in corpus (30)

• Bayesian Temporal Factorization for Multidimensional Time Series Prediction
• Tensor Networks for Dimensionality Reduction and Large-Scale Optimizations. Part 2 Applications and Future Perspectives
• A Nonconvex Low-Rank Tensor Completion Model for Spatiotemporal Traffic Data Imputation
• Linked Component Analysis from Matrices to High Order Tensors: Applications to Biomedical Data
• Low-Rank Autoregressive Tensor Completion for Spatiotemporal Traffic Data Imputation
• Guaranteed Tensor Recovery Fused Low-rankness and Smoothness
• Implicit Regularization in Deep Learning May Not Be Explainable by Norms
• Brain-Computer Interface with Corrupted EEG Data: A Tensor Completion Approach
• Tensor Train Factorization and Completion under Noisy Data with Prior Analysis and Rank Estimation
• Tensor Completion Algorithms in Big Data Analytics
• Fast Position-Aided MIMO Beam Training via Noisy Tensor Completion
• Tensor Completion for Weakly-dependent Data on Graph for Metro Passenger Flow Prediction
• New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
• Robust Factorization of Real-world Tensor Streams with Patterns, Missing Values, and Outliers
• Manifold Modeling in Embedded Space: A Perspective for Interpreting Deep Image Prior
• A generalizable framework for low-rank tensor completion with numerical priors
• A case study of spatiotemporal forecasting techniques for weather forecasting
• Efficient Constrained Tensor Factorization by Alternating Optimization with Primal-Dual Splitting
• Tensor Recovery from Noisy and Multi-Level Quantized Measurements
• Concatenated image completion via tensor augmentation and completion
• Long-Short Term Spatiotemporal Tensor Prediction for Passenger Flow Profile
• Hierarchical Tensor Ring Completion
• Implicit Regularization in Tensor Factorization
• Variational Bayesian inference for CP tensor completion with side information
• Latent Functional PARAFAC for modeling multidimensional longitudinal data
• New penalized criteria for smooth non-negative tensor factorization with missing entries
• Spatio-Temporal Tensor Sketching via Adaptive Sampling
• An Efficient Tensor Completion Method via New Latent Nuclear Norm
• Low-rank quaternion tensor completion for recovering color videos and images
• Tensor p-shrinkage nuclear norm for low-rank tensor completion