A new algorithm by embedding structured data for low-rank tensor ring completion
In this paper, we put up with a new algorithm for tensor completion problems that include missing slices or row/column fibers, where embedding a structured tensor by a multi-way delay-embedding transform (MDT) makes the tensor to be completed have a special structure. The main idea is to employ a te...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2025-03-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2025297 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we put up with a new algorithm for tensor completion problems that include missing slices or row/column fibers, where embedding a structured tensor by a multi-way delay-embedding transform (MDT) makes the tensor to be completed have a special structure. The main idea is to employ a tensor completion algorithm based on the tensor ring rank, constructing latent tensor ring factors with a structure that approximates the original tensor starting from the tensor structure. It is also proved that the sequence generated by the new algorithm converges to the optimal solution. Finally, the feasibility of the proposed algorithm is verified by experiments. Compared with other completed algorithms based on tensor ring rank, the completed accuracy is improved, up to 30%. |
|---|---|
| ISSN: | 2473-6988 |