Smooth PARAFAC Decomposition for Tensor Completion

DOI10.1109/TSP.2016.2586759zbMath1414.94716arXiv1505.06611OpenAlexW1568416770MaRDI QIDQ4620995

Qibin Zhao, Tatsuya Yokota, Andrzej Cichocki

Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.06611

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (18)

Tensor train rank minimization with hybrid smoothness regularization for visual data recovery ⋮ Tensor completion via fully-connected tensor network decomposition with regularized factors ⋮ An approximation method of CP rank for third-order tensor completion ⋮ Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion ⋮ 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 ⋮ Enhancing matrix completion using a modified second-order total variation ⋮ Nonconvex tensor rank minimization and its applications to tensor recovery ⋮ Tensor Completion via Gaussian Process--Based Initialization ⋮ Block tensor train decomposition for missing data estimation ⋮ Tensor completion based on triple tubal nuclear norm ⋮ Tensor train rank minimization with nonlocal self-similarity for tensor completion ⋮ Majorized proximal alternating imputation for regularized rank constrained matrix completion ⋮ Low-rank tensor completion via smooth matrix factorization ⋮ New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition

This page was built for publication: Smooth PARAFAC Decomposition for Tensor Completion