Canonical polyadic decomposition of third-order semi-nonnegative semi-symmetric tensors using LU and QR matrix factorizations

• Published in: EURASIP journal on advances in signal processing Vol. 2014; no. 1; pp. 1 - 23
• Main Authors: Wang, Lu, Albera, Laurent, Kachenoura, Amar, Shu, Huazhong, Senhadji, Lotfi
• Format: Journal Article
• Language: English
• Published: Cham Springer International Publishing 08.10.2014; Springer Nature B.V; BioMed Central Ltd; SpringerOpen
• Subjects: Algorithms; Arrays; Bioengineering; Channels; Decomposition; Engineering; Engineering Sciences; Factorization; Life Sciences; Mathematical models; Optimization; Quantum Information Technology; Recent Advances in Tensor Based Signal and Image Processing; Searching; Signal and Image processing; Signal processing; Signal,Image and Speech Processing; Spintronics; Canonical polyadic decomposition; Magnetic resonance spectroscopy; Individual differences in scaling analysis; Independent component analysis; Semi-nonnegative semi-symmetric tensor; Blind source separation; Joint diagonalization by congruence
• ISSN: 1687-6180; 1687-6172; 1687-6180
• DOI: 10.1186/1687-6180-2014-150

Semi-symmetric three-way arrays are essential tools in blind source separation (BSS) particularly in independent component analysis (ICA). These arrays can be built by resorting to higher order statistics of the data. The canonical polyadic (CP) decomposition of such semi-symmetric three-way arrays allows us to identify the so-called mixing matrix, which contains the information about the intensities of some latent source signals present in the observation channels. In addition, in many applications, such as the magnetic resonance spectroscopy (MRS), the columns of the mixing matrix are viewed as relative concentrations of the spectra of the chemical components. Therefore, the two loading matrices of the three-way array, which are equal to the mixing matrix, are nonnegative. Most existing CP algorithms handle the symmetry and the nonnegativity separately. Up to now, very few of them consider both the semi-nonnegativity and the semi-symmetry structure of the three-way array. Nevertheless, like all the methods based on line search, trust region strategies, and alternating optimization, they appear to be dependent on initialization, requiring in practice a multi-initialization procedure. In order to overcome this drawback, we propose two new methods, called JD LU + and JD QR + , to solve the problem of CP decomposition of semi-nonnegative semi-symmetric three-way arrays. Firstly, we rewrite the constrained optimization problem as an unconstrained one. In fact, the nonnegativity constraint of the two symmetric modes is ensured by means of a square change of variable. Secondly, a Jacobi-like optimization procedure is adopted because of its good convergence property. More precisely, the two new methods use LU and QR matrix factorizations, respectively, which consist in formulating high-dimensional optimization problems into several sequential polynomial and rational subproblems. By using both LU and QR matrix factorizations, we aim at studying the influence of the used matrix factorization. Numerical experiments on simulated arrays emphasize the advantages of the proposed methods especially the one based on LU factorization, in the presence of high-variance model error and of degeneracies such as bottlenecks. A BSS application on MRS data confirms the validity and improvement of the proposed methods.