Adaptive Cross Tubal Tensor Approximation

by   Salman Ahmadi Asl, et al.

In this paper, we propose a new adaptive cross algorithm for computing a low tubal rank approximation of third-order tensors, with less memory and lower computational complexity than the truncated tensor SVD (t-SVD). This makes it applicable for decomposing large-scale tensors. We conduct numerical experiments on synthetic and real-world datasets to confirm the efficiency and feasibility of the proposed algorithm. The simulation results show more than one order of magnitude acceleration in the computation of low tubal rank (t-SVD) for large-scale tensors. An application to pedestrian attribute recognition is also presented.


page 18

page 22

page 28


T-Singular Values and T-Sketching for Third Order Tensors

Based upon the T-SVD (tensor SVD) of third order tensors, introduced by ...

Faster Tensor Train Decomposition for Sparse Data

In recent years, the application of tensors has become more widespread i...

A rank-adaptive higher-order orthogonal iteration algorithm for truncated Tucker decomposition

We propose a novel rank-adaptive higher-order orthogonal iteration (HOOI...

High order cumulant tensors and algorithm for their calculation

In this paper, we introduce a novel algorithm for calculating arbitrary ...

Characterizing digital microstructures by the Minkowski-based quadratic normal tensor

For material modeling of microstructured media, an accurate characteriza...

Representing three-dimensional cross fields using 4th order tensors

This paper presents a new way of describing cross fields based on fourth...

CP-TT: using TT-SVD to greedily construct a Canonical Polyadic tensor approximation

In the present work, a method is proposed in order to compute a Canonica...

Please sign up or login with your details

Forgot password? Click here to reset