"Sparse + Low-Rank'' Tensor Completion Approach for Recovering Images and Videos
Not on the map. Why?
Abstract (arXiv)
Recovering color images and videos from highly undersampled data is a fundamental and challenging task in face recognition and computer vision. By the multi-dimensional nature of color images and videos, in this paper, we propose a novel tensor completion approach, which is able to efficiently explore the sparsity of tensor data under the discrete cosine transform (DCT). Specifically, we introduce two ``sparse + low-rank'' tensor completion models as well as two implementable algorithms for finding their solutions. The first one is a DCT-based sparse plus weighted nuclear norm induced low-rank minimization model. The second one is a DCT-based sparse plus p-shrinking mapping induced low-rank optimization model. Moreover, we accordingly propose two implementable augmented Lagrangian-based algorithms for solving the underlying optimization models. A series of numerical experiments including color image inpainting and video data recovery demonstrate that our proposed approach performs better than many existing state-of-the-art tensor completion methods, especially for the case when the ratio of missing data is high.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 61 references that are in the map. First posted on arXiv 18 Oct 2021.
Builds on
15 of 61 references.
References · 15
- 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 112
- 2015Exact tensor completion using t-SVDcited by 70
- 2014Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determinationcited by 65
- 2016Efficient tensor completion for color image and video recovery: Low-rank tensor traincited by 61
- 2017Tensor Completion Algorithms in Big Data Analyticscited by 48
- 2019Framelet Representation of Tensor Nuclear Norm for Third-Order Tensor Completioncited by 37
- 2017Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimizationcited by 35
- 2015Smooth PARAFAC Decomposition for Tensor Completioncited by 34
- 2014On Tensor Completion via Nuclear Norm Minimizationcited by 32
- 2015Nonconvex Nonsmooth Low-Rank Minimization via Iteratively Reweighted Nuclear Normcited by 23
- 2018Tensor N-tubal rank and its convex relaxation for low-rank tensor recoverycited by 19
- 2020Dictionary Learning with Low-rank Coding Coefficients for Tensor Completioncited by 19
3 more
Built on by
Not cited yet.