Robust Low-Rank Tensor Completion based on M-product with Weighted Correlated Total Variation and Sparse Regularization
Biswarup Karmakar, Ratikanta Behera

TL;DR
This paper introduces a novel tensor completion method using weighted correlated total variation and sparse regularization within an M-product framework, improving the recovery of corrupted high-dimensional data.
Contribution
It proposes a new regularizer and weighting scheme that better preserves tensor structures and details, with an efficient ADMM algorithm and convergence analysis.
Findings
Outperforms benchmark methods in image completion and denoising.
Effectively preserves critical tensor structures and details.
Demonstrates superior robustness to noise and outliers.
Abstract
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 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 -product framework that combines a weighted Schatten- norm on gradient tensors for low-rankness with smoothness enforcement and weighted sparse components for noise suppression. The proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
