Robust Low-Rank Tensor Completion based on M-product with Weighted Correlated Total Variation and Sparse Regularization
Not on the map. Why?
Abstract (arXiv)
The robust low-rank tensor completion problem addresses the challenge of recovering corrupted high-dimensional tensor data with missing entries, outliers, and sparse noise commonly found in real-world applications. Existing methodologies have encountered fundamental limitations due to their reliance on uniform regularization schemes, particularly the tensor nuclear norm and ℓ1 norm regularization approaches, which indiscriminately apply equal shrinkage to all singular values and sparse components, thereby compromising the preservation of critical tensor structures. The proposed tensor weighted correlated total variation (TWCTV) regularizer addresses these shortcomings through an M-product framework that combines a weighted Schatten-p norm on gradient tensors for low-rankness with smoothness enforcement and weighted sparse components for noise suppression. The proposed weighting scheme adaptively reduces the thresholding level to preserve both dominant singular values and sparse components, thus improving the reconstruction of critical structural elements and nuanced details in the recovered signal. Through a systematic algorithmic approach, we introduce an enhanced alternating direction method of multipliers (ADMM) that offers both computational efficiency and theoretical substantiation, with convergence properties comprehensively analyzed within the M-product framework.Comprehensive numerical evaluations across image completion, denoising, and background subtraction tasks validate the superior performance of this approach relative to established benchmark methods.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 47 references that are in the map. First posted on arXiv 15 Apr 2026.
Builds on
11 of 47 references.
References · 11
- 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 112
- 2014Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determinationcited by 65
- 2017Hyperspectral Image Restoration via Total Variation Regularized Low-rank Tensor Decompositioncited by 61
- 2017Tensor Completion Algorithms in Big Data Analyticscited by 48
- 2023Guaranteed Tensor Recovery Fused Low-rankness and Smoothnesscited by 41
- 2015Smooth PARAFAC Decomposition for Tensor Completioncited by 34
- 2014Efficient Nonnegative Tucker Decompositions: Algorithms and Uniquenesscited by 17
- 2017A Benchmark for Sparse Coding: When Group Sparsity Meets Rank Minimizationcited by 10
- 2023Nonconvex Robust High-Order Tensor Completion Using Randomized Low-Rank Approximationcited by 7
- 2017Non-Convex Weighted Lp Minimization based Group Sparse Representation Framework for Image Denoisingcited by 5
- 2020Multi-Tubal Rank of Third Order Tensor and Related Low Rank Tensor Completion Problemcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.