Fast and Accurate Tensor Completion With Total Variation Regularized Tensor Trains

DOI10.1109/TIP.2020.2995061MaRDI QIDQ5105685zbMATH OpenFDO

Authors

Publication date 16 September 2022

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

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

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited in

(14)

• An Adaptive Correction Approach for Tensor Completion
• dMRI reconstruction based on tensor ring and \(\ell_{1-2}\) norm constrained model with plug-and-play regularization
• Multi-mode tensor train factorization with spatial-spectral regularization for third-order tensor completion
• Convenient tail bounds for sums of random tensors
• General tail bounds for random tensors summation: majorization approach
• Accurate regularized Tucker decomposition for image restoration
• Tensor Completion via Gaussian Process--Based Initialization
• A tensor train approach for internet traffic data completion
• Tensor train factorization with spatio-temporal smoothness for streaming low-rank tensor completion
• Efficient randomized algorithms for computing an approximation of the tensor train decomposition
• Black Box Approximation in the Tensor Train Format Initialized by ANOVA Decomposition
• A novel two-stage robust tensor completion method via enhanced global recovery and local patch-level refinement
• Low-dimensional subspace regularization through structured tensor priors
• Iterative tensor eigen rank minimization for low-rank tensor completion

This page was built for publication: Fast and Accurate Tensor Completion With Total Variation Regularized Tensor Trains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5105685)