Canonical Polyadic Decomposition Based on a Single Mode Blind Source Separation

A new canonical polyadic (CP) decomposition method is proposed in this letter, where one factor matrix is extracted first by using any standard blind source separation (BSS) method and the remainder components are computed efficiently via sequential singular value decompositions of rank-1 matrices. The new approach provides more interpretable factors and it is extremely efficient for ill-conditioned problems. Especially, it overcomes the bottleneck problems, which often cause very slow convergence speed in CP decompositions. Simulations confirmed the validity and efficiency of the proposed method.

[1]  Lieven De Lathauwer,et al.  A Method to Avoid Diverging Components in the Candecomp/Parafac Model for Generic I˟J˟2 Arrays , 2008, SIAM J. Matrix Anal. Appl..

[2]  Andrzej Cichocki,et al.  Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation , 2012, IEEE Transactions on Signal Processing.

[3]  Sameer A. Nene,et al.  Columbia Object Image Library (COIL100) , 1996 .

[4]  Andrzej Cichocki,et al.  Adaptive Blind Signal and Image Processing - Learning Algorithms and Applications , 2002 .

[5]  S. Kindermann,et al.  Analysis and Approximation of the Canonical Polyadic Tensor Decomposition , 2011, 1109.3832.

[6]  Hai-Long Wu,et al.  On the self‐weighted alternating trilinear decomposition algorithm—the property of being insensitive to excess factors used in calculation , 2001 .

[7]  J. Chang,et al.  Analysis of individual differences in multidimensional scaling via an n-way generalization of “Eckart-Young” decomposition , 1970 .

[8]  P. Comon,et al.  Tensor decompositions, alternating least squares and other tales , 2009 .

[9]  J. Kruskal Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics , 1977 .

[10]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[11]  Vin de Silva,et al.  Tensor rank and the ill-posedness of the best low-rank approximation problem , 2006, math/0607647.

[12]  C. F. Beckmann,et al.  Tensorial extensions of independent component analysis for multisubject FMRI analysis , 2005, NeuroImage.

[13]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorization T , 2007 .

[14]  Richard A. Harshman,et al.  Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-model factor analysis , 1970 .

[15]  N. Sidiropoulos,et al.  On the uniqueness of multilinear decomposition of N‐way arrays , 2000 .