Tensor decomposition has recently become a popular method of multi-dimensional data analysis in various applications. The main interest in tensor decomposition is for dimensionality reduction, approximation or subspace purposes. However, the emergence of “big data” now gives rise to increased computational complexity for performing tensor decomposition. In this paper, motivated by the advantages of the generalized minimum noise subspace (GMNS) method, recently proposed for array processing, we proposed two algorithms for principal subspace analysis (PSA) and two algorithms for tensor decomposition using parallel factor analysis (PARAFAC) and higher-order singular value decomposition (HOSVD). The proposed decomposition algorithms can preserve several desired properties of PARAFAC and HOSVD while substantially reducing the computational complexity. Performance comparisons of PSA and tensor decomposition of our proposed algorithms against the state-of-the-art ones were studied via numerical experiments. Experimental results indicated that the proposed algorithms are of practical values.
Speaker: Mr. Le Trung Thanh, AVITECH
Time: 15:30, Tuesday, October 23, 2018
Venue: G2-315, 144 Xuan Thuy, Cau Giay, Hanoi
Le Trung Thanh received B.Sc. and M.Sc. degrees in Electronics and Telecommunications from the VNU University of Engineering and Technology (VNU-UET), a member of Vietnam National University, Hanoi (VNU) in 2016 and 2018 respectively. He is now pursuing his Ph.D. study at the University of Orleans, France. His research interests include signal processing, subspace tracking, tensor analysis, and system identification.