Nguyen, Viet Dung and Abed-Meraim, Karim and Nguyen, Linh Trung (2016) Fast adaptive PARAFAC decomposition algorithm with linear complexity. In: 41th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 20-25 March, Shanghai, China.
![[img]](https://eprints.uet.vnu.edu.vn/eprints/style/images/fileicons/application_pdf.png) |
PDF
- Published Version
Restricted to Registered users only Download (207kB) |
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 (Poster) |
|---|---|
| Subjects: | Electronics and Communications |
| Divisions: | Faculty of Electronics and Telecommunications (FET) |
| Depositing User: | A/Prof. Linh Trung Nguyen |
| Date Deposited: | 25 Dec 2016 16:57 |
| Last Modified: | 25 Dec 2016 16:57 |
| URI: | http://eprints.uet.vnu.edu.vn/eprints/id/eprint/2192 |
Actions (login required)
 |
View Item |
