VNU-UET Repository

Fast adaptive PARAFAC decomposition algorithm with linear complexity

Viet Dung Nguyen and Karim Abed-Meraim and Linh Trung Nguyen (2016) Fast adaptive PARAFAC decomposition algorithm with linear complexity. In: 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 20-25 March 2016, China.

[img] PDF
230kB

Official URL: http://www.icassp2016.org

Abstract

We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension growing with time. It has linear complexity, good convergence rate and good estimation accuracy. To deal with large-scale problems, a parallel implementation can be applied to reduce both computational complexity and storage. We illustrate the effectiveness of our algorithm in comparison with the state-of-the-art algorithms through simulation experiments.

Item Type:Conference or Workshop Item (Paper)
Subjects:Electronics and Communications
Electronics and Communications > Electronics and Computer Engineering
Divisions:Faculty of Electronics and Telecommunications (FET)
ID Code:1766
Deposited By: Assoc/Prof Duc Tan Tran
Deposited On:09 Jun 2016 02:15
Last Modified:09 Jun 2016 02:15

Repository Staff Only: item control page