Fast adaptive PARAFAC decomposition algorithm with linear complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Fast adaptive PARAFAC decomposition algorithm with linear complexity

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 grow- ing 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.
Fichier principal
Vignette du fichier
3DOPASTLinear.pdf (313.27 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01306461 , version 1 (05-08-2016)

Identifiers

  • HAL Id : hal-01306461 , version 1

Cite

Viet-Dung Nguyen, Karim Abed-Meraim, Linh-Trung Nguyen. Fast adaptive PARAFAC decomposition algorithm with linear complexity. International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016), Mar 2016, Shanghai, China. ⟨hal-01306461⟩
172 View
168 Download

Share

Gmail Facebook X LinkedIn More