Name
Abstract | ||
|---|---|---|
Cross Tensor Approximation (CTA) is a generalization of Cross/skeleton matrix and CUR Matrix Approximation (CMA) and is a suitable tool for fast low-rank tensor approximation. It facilitates interpreting the underlying data tensors and decomposing/compressing tensors so that their structures, such as nonnegativity, smoothness, or sparsity, can be potentially preserved. This paper reviews and extends state-of-the-art deterministic and randomized algorithms for CTA with intuitive graphical illustrations. We discuss several possible generalizations of the CMA to tensors, including CTAs: based on fiber selection, slice-tube selection, and lateral-horizontal slice selection. The main focus is on the CTA algorithms using Tucker and tubal SVD (t-SVD) models while we provide references to other decompositions such as Tensor Train (TT), Hierarchical Tucker (HT), and Canonical Polyadic (CP) decompositions. We evaluate the performance of the CTA algorithms by extensive computer simulations to compress color and medical images and compare their performance. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/ACCESS.2021.3125069 | IEEE ACCESS |
Keywords | DocType | Volume |
Tensors, Approximation algorithms, Matrix decomposition, Signal processing algorithms, Sparse matrices, Optimization, Licenses, CUR algorithms, cross approximation, tensor decomposition, tubal SVD, randomization | Journal | 9 |
ISSN | Citations | PageRank |
2169-3536 | 1 | 0.35 |
References | Authors | |
76 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Salman Ahmadi-Asl | 1 | 8 | 2.49 |
| Cesar F. Caiafa | 2 | 1 | 0.35 |
| Andrzej Cichocki | 3 | 5228 | 508.42 |
| Anh Huy Phan | 4 | 828 | 51.60 |
| T. Tanaka | 5 | 638 | 95.91 |
| Ivan V. Oseledets | 6 | 306 | 41.96 |
| Jun Wang | 7 | 1 | 0.35 |