Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
DOI10.1007/S10915-019-01044-8zbMATH Open1466.94005OpenAlexW2970760100WikidataQ127302141 ScholiaQ127302141MaRDI QIDQ2333730FDOQ2333730
Authors: Meng Ding, Ting-Zhu Huang, Teng-Yu Ji, Xi-Le Zhao, Jing Hua Yang
Publication date: 13 November 2019
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-019-01044-8
Recommendations
- Tensor completion using total variation and low-rank matrix factorization
- Tensor Factorization for Low-Rank Tensor Completion
- Low-rank tensor completion based on log-det rank approximation and matrix factorization
- Low-rank tensor completion via smooth matrix factorization
- Matrix factorization for low-rank tensor completion using framelet prior
- A new tensor multi-rank approximation with total variation regularization for tensor completion
- On the equivalence between low-rank matrix completion and tensor rank
- Enhancing low-rank tensor completion via first-order and second-order total variation regularizations
- Low-CP-rank tensor completion via practical regularization
- Tensor train rank minimization with nonlocal self-similarity for tensor completion
Numerical optimization and variational techniques (65K10) Direct numerical methods for linear systems and matrix inversion (65F05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Nonlinear total variation based noise removal algorithms
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Tensor Decompositions and Applications
- Tensor-train decomposition
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Parallel matrix factorization for low-rank tensor completion
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Most tensor problems are NP-hard
- A new convex optimization model for multiplicative noise and blur removal
- DMRG approach to fast linear algebra in the TT-format
- Multigrid accelerated tensor approximation of function related multidimensional arrays
- Tensor completion using total variation and low-rank matrix factorization
- An Augmented Lagrangian Method for Total Variation Video Restoration
- Total variation structured total least squares method for image restoration
- A mixture of nuclear norm and matrix factorization for tensor completion
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Cauchy noise removal by nonconvex ADMM with convergence guarantees
- A non-convex tensor rank approximation for tensor completion
- Coupled segmentation and denoising/deblurring models for hyperspectral material identification.
- Matrix factorization for low-rank tensor completion using framelet prior
- Total Variation Regularized Tensor RPCA for Background Subtraction From Compressive Measurements
Cited In (25)
- Tensor train rank minimization with hybrid smoothness regularization for visual data recovery
- Parallel matrix factorization for low-rank tensor completion
- Low-CP-rank tensor completion via practical regularization
- A tensor regularized nuclear norm method for image and video completion
- Low-rank tensor completion via smooth matrix factorization
- Constrained tensorial total variation problem based on an alternating conditional gradient algorithm
- Tensor completion using total variation and low-rank matrix factorization
- Three-dimensional fractional total variation regularized tensor optimized model for image deblurring
- Tensor \(N\)-tubal rank and its convex relaxation for low-rank tensor recovery
- TR-STF: a fast and accurate tensor ring decomposition algorithm via defined scaled tri-factorization
- A fast algorithm for rank-\((L, M, N)\) block term decomposition of multi-dimensional data
- Cauchy noise removal using group-based low-rank prior
- Low tubal rank tensor completion based on singular value factors
- Fast multidimensional completion and principal component analysis methods via the cosine product
- Tensor train rank minimization with nonlocal self-similarity for tensor completion
- Adaptive total variation and second-order total variation-based model for low-rank tensor completion
- Fast image inpainting strategy based on the space-fractional modified Cahn-Hilliard equations
- Robust tensor recovery with nonconvex and nonsmooth regularization
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Nonlinear transform induced tensor nuclear norm for tensor completion
- T-product factorization based method for matrix and tensor completion problems
- Remove the salt and pepper noise based on the high order total variation and the nuclear norm regularization
- Spectral computation with third-order tensors using the t-product
- Block tensor train decomposition for missing data estimation
- Mixed norm regularized models for low-rank tensor completion
This page was built for publication: Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333730)