High-order Tensor Completion for Data Recovery via Sparse Tensor-train Optimization
Not on the map. Why?
Abstract (arXiv)
In this paper, we aim at the problem of tensor data completion. Tensor-train decomposition is adopted because of its powerful representation ability and linear scalability to tensor order. We propose an algorithm named Sparse Tensor-train Optimization (STTO) which considers incomplete data as sparse tensor and uses first-order optimization method to find the factors of tensor-train decomposition. Our algorithm is shown to perform well in simulation experiments at both low-order cases and high-order cases. We also employ a tensorization method to transform data to a higher-order form to enhance the performance of our algorithm. The results of image recovery experiments in various cases manifest that our method outperforms other completion algorithms. Especially when the missing rate is very high, e.g., 90% to 99%, our method is significantly better than the state-of-the-art methods.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Nov 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1.
3 papers.
- 2022Rethinking Bayesian Learning for Data Analysis: The Art of Prior and Inference in Sparsity-Aware Modelingcited by 12
- 2021Coarse to Fine Two-Stage Approach to Robust Tensor Completion of Visual Datacited by 3
- 2023To Fold or Not to Fold: Graph Regularized Tensor Train for Visual Data Completioncited by 3
- 2023To Fold or Not to Fold: Graph Regularized Tensor Train for Visual Data Completion19 Jun 2023
- 2022Rethinking Bayesian Learning for Data Analysis: The Art of Prior and Inference in Sparsity-Aware Modeling28 May 2022
- 2021Coarse to Fine Two-Stage Approach to Robust Tensor Completion of Visual Data19 Jun 2021