mlsanityData to 7 Oct 2026

Effective Tensor Completion via Element-wise Weighted Low-rank Tensor Train with Overlapping Ket Augmentation

arXiv 2109.05736 ↗First posted 13 Sep 2021cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

In recent years, there have been an increasing number of applications of tensor completion based on the tensor train (TT) format because of its efficiency and effectiveness in dealing with higher-order tensor data. However, existing tensor completion methods using TT decomposition have two obvious drawbacks. One is that they only consider mode weights according to the degree of mode balance, even though some elements are recovered better in an unbalanced mode. The other is that serious blocking artifacts appear when the missing element rate is relatively large. To remedy such two issues, in this work, we propose a novel tensor completion approach via the element-wise weighted technique. Accordingly, a novel formulation for tensor completion and an effective optimization algorithm, called as tensor completion by parallel weighted matrix factorization via tensor train (TWMac-TT), is proposed. In addition, we specifically consider the recovery quality of edge elements from adjacent blocks. Different from traditional reshaping and ket augmentation, we utilize a new tensor augmentation technique called overlapping ket augmentation, which can further avoid blocking artifacts. We then conduct extensive performance evaluations on synthetic data and several real image data sets. Our experimental results demonstrate that the proposed algorithm TWMac-TT outperforms several other competing tensor completion methods.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 14 of its 79 references that are in the map. First posted on arXiv 13 Sep 2021.

Builds on

14 of 79 references.

References · 14

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Tensorizing Neural Networkscited by 246
  3. 2016Tensor Ring Decompositioncited by 125
  4. 2015Exact tensor completion using t-SVDcited by 70
  5. 2014Bayesian CP Factorization of Incomplete Tensors with Automatic Rank Determinationcited by 65
  6. 2016Efficient tensor completion for color image and video recovery: Low-rank tensor traincited by 61
  7. 2017Efficient Low Rank Tensor Ring Completioncited by 45
  8. 2015Smooth PARAFAC Decomposition for Tensor Completioncited by 34
  9. 2017Weighted Low-rank Tensor Recovery for Hyperspectral Image Restorationcited by 30
  10. 2020Multi-View Spectral Clustering Tailored Tensor Low-Rank Representationcited by 21
  11. 2018Fast and Accurate Tensor Completion with Total Variation Regularized Tensor Trainscited by 14
  12. 2017A dual framework for low-rank tensor completioncited by 9
2 more
  1. 2015Matrix Product State for Feature Extraction of Higher-Order Tensorscited by 6
  2. 2016Concatenated image completion via tensor augmentation and completioncited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 1; 2025: 3; 2026: 1.

8 papers.