Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
From MaRDI portal
Publication:4618805
DOI10.1109/TIP.2017.2672439zbMath1409.94036arXiv1606.01500OpenAlexW3124414826WikidataQ38941829 ScholiaQ38941829MaRDI QIDQ4618805
Minh N. do, Ho Ngoc Phien, Johann A. Bengua, Hoang Duong Tuan
Publication date: 5 February 2019
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.01500
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (34)
Tensor train rank minimization with hybrid smoothness regularization for visual data recovery ⋮ Adaptive singular value shrinkage estimate for low rank tensor denoising ⋮ Interpolatory tensorial reduced order models for parametric dynamical systems ⋮ Tensor completion via fully-connected tensor network decomposition with regularized factors ⋮ Nonlinear transform induced tensor nuclear norm for tensor completion ⋮ Robust low transformed multi-rank tensor methods for image alignment ⋮ Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion ⋮ Iterative hard thresholding for low CP-rank tensor models ⋮ Auto-weighted robust low-rank tensor completion via tensor-train ⋮ Fully-connected tensor network decomposition for robust tensor completion problem ⋮ Tensor rank reduction via coordinate flows ⋮ Low tubal rank tensor completion based on singular value factors ⋮ Iterative tensor eigen rank minimization for low-rank tensor completion ⋮ A generalized non-convex method for robust tensor completion ⋮ A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion ⋮ Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery ⋮ Variational Bayesian inference for CP tensor completion with subspace information ⋮ Provable stochastic algorithm for large-scale fully-connected tensor network decomposition ⋮ T-product factorization based method for matrix and tensor completion problems ⋮ Iterative \(p\)-shrinkage thresholding algorithm for low Tucker rank tensor recovery ⋮ Nonnegative Tensor Patch Dictionary Approaches for Image Compression and Deblurring Applications ⋮ Block tensor train decomposition for missing data estimation ⋮ Low-rank tensor train for tensor robust principal component analysis ⋮ Tensor train rank minimization with nonlocal self-similarity for tensor completion ⋮ The nonconvex tensor robust principal component analysis approximation model via the weighted \(\ell_p\)-norm regularization ⋮ Low-rank tensor completion based on log-det rank approximation and matrix factorization ⋮ Low-rank tensor completion using matrix factorization based on tensor train rank and total variation ⋮ Nonlocal robust tensor recovery with nonconvex regularization * ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD ⋮ Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms ⋮ New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition ⋮ Efficient low-rank regularization-based algorithms combining advanced techniques for solving tensor completion problems with application to color image recovering ⋮ A tensor regularized nuclear norm method for image and video completion
This page was built for publication: Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train