Tải bản đầy đủ (.pdf) (2 trang)

Fast adaptive PARAFAC decomposition algorithm with linear complexity

Bạn đang xem bản rút gọn của tài liệu. Xem và tải ngay bản đầy đủ của tài liệu tại đây (225.07 KB, 2 trang )

<span class='text_page_counter'>(1)</span><div class='page_container' data-page=1>

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


Page 1 of 2
/>


Browse Conference Publications > 2016 IEEE International Confe ...

<b>Fast adaptive PARAFAC</b>



<b>decomposition algorithm with linear</b>


<b>complexity</b>



Full Text



<b>Sign-In or Purchase</b>


3



<b>Author(s)</b>


<b>Page(s):</b>


6235 - 6239


<b>Conference Location :</b>


Shanghai, China


<b>DOI:</b>


10.1109/ICASSP.2016.7472876



<b>Publisher:</b>


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.


<b>Published in:</b>


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


<b>Date of Conference:</b>


20-25 March 2016


<b>Institutional Sign In</b>


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


<b>Authors</b>

<b>References</b>

<b>Cited By</b>

<b>Keywords</b>

<b>Metrics</b>

<b>Similar</b>



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


<b>Abstract</b>




</div>
<span class='text_page_counter'>(2)</span><div class='page_container' data-page=2>

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


Page 2 of 2
/>


<b>IEEE Account</b>


»Change Username/Password


»Update Address


<b>Purchase Details</b>


»Payment Options


»Order History


»View Purchased Documents


<b>Profile Information</b>


»Communications Preferences


»Profession and Education


»Technical Interests


<b>Need Help?</b>


»<b>US & Canada: +1 800 678 4333</b>



»<b>Worldwide: +1 732 981 0060</b>


»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|


</div>

<!--links-->
<a href=' />

×