1. Trang chủ
  2. » Trung học cơ sở - phổ thông

Fast adaptive PARAFAC decomposition algorithm with linear complexity

2 10 0

Đang tải... (xem toàn văn)

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 2
Dung lượng 225,07 KB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

6/7/16, 9:14 PM IEEE Xplore Abstract - Fast adaptive PARAFAC decomposition algorithm with linear complexity.. Page 1 of 2 http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=747287[r]

Trang 1

6/7/16, 9:14 PM IEEE Xplore Abstract - Fast adaptive PARAFAC decomposition algorithm with linear complexity

Page 1 of 2 http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7472876&url=…2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D7472876

Browse Conference Publications > 2016 IEEE International Confe

Fast adaptive PARAFAC

decomposition algorithm with linear

complexity

Full Text

Sign-In or Purchase

3

Author(s)

Page(s):

6235 - 6239

Conference Location :

Shanghai, China

DOI:

10.1109/ICASSP.2016.7472876

Publisher:

IEEE

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

Published in:

2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

Date of Conference:

20-25 March 2016

Institutional Sign In

Viet-Dung Nguyen ; PRISME Laboratory, University of Orl��ans, France ; Karim Abed-Meraim ; Nguyen Linh-Trung

IEEE.org IEEE Xplore Digital Library| |IEEE-SA|IEEE Spectrum|More Sites Cart (0) Create Account| |Personal Sign In

Abstract

Trang 2

6/7/16, 9:14 PM IEEE Xplore Abstract - Fast adaptive PARAFAC decomposition algorithm with linear complexity

Page 2 of 2 http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7472876&url=…2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D7472876

IEEE Account

Purchase Details

Profile Information

Need Help?

»Contact & Support

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.

© Copyright 2016 IEEE - All rights reserved Use of this web site signifies your agreement to the terms and conditions.

Personal Sign In Create Account|

About IEEE Xplore Contact Us| | Help | Terms of Use | Nondiscrimination Policy | Sitemap | Privacy & Opting Out of Cookies

Ngày đăng: 21/01/2021, 05:06

TÀI LIỆU CÙNG NGƯỜI DÙNG

TÀI LIỆU LIÊN QUAN