.png){kind=icon}
.png){kind=icon}
Return
Cross Tensor Approximation Methods for Compression and Dimensionality Reduction
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3125069.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Tensors
Approximation algorithms
Matrix decomposition
Signal processing algorithms
Sparse matrices
Optimization
Licenses
CUR algorithms
cross approximation
tensor decomposition
tubal SVD
randomization
Journal
IF:
3.6
Papers:
9.7W
Citations:
29.4W