Canonical Polyadic Decomposition Based on a Single Mode Blind Source Separation

IEEE Signal Processing Letters

Volumn 19, Issue 8, 2012, Pages 523-526

  Zhou, Guoxu ^a,b   Cichocki, Andrzej ^a,c  

^a RIKEN BRAIN SCIENCE INSTITUTE   (Japan)

^b SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^c SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Blind source separation; bottleneck problem; CP (PARAFAC) decompositions; tensor decompositions

Indexed keywords

EID: 85008574320     PISSN: 10709908     EISSN: 15582361     Source Type: Journal    
DOI: 10.1109/LSP.2012.2205237     Document Type: Article

References (17)

1. A. Cichocki, R. Zdunek, A. -H. Phan, and S. Amari, Nonnegative Matrix and TensorFactorizations: Applications to Exploratory Multi-way DataAnalysis and BlindSource Separation. Chichester, U. K.: Wiley, 2009.
2. J. Carroll and J. -J. Chang, “Analysis of individual differences in multidimensional scaling via an n-way generalization of Eckart-Young decomposition,” Psychometrika, vol. 35, no. 3, pp. 283–319, September 1970.
3. R. A. Harshman, “Foundations of the PARAFAC procedure: Models and conditions for an ‘explanatory’ multi-modal factor analysis,” UCLA Working Papers in Phonetics vol. 16, no. 1, 1970.
4. V. De Silva and L. -H. Lim, “Tensor rank and the ill-posedness of the best low-rank approximation problem,” SIAM J. Matrix Anal. Applicat., vol. 30, no. 3, pp. 1084–1127, 2008.
5. A. Stegeman and L. D. Lathauwer, “A method to avoid diverging components in the CANDECOMP/PARAFAC model for generic ix7x2 arrays,” SIAMJ. MatrixAnal. Applicat., vol. 30, no. 4, pp. 1614–1638, 2009.
6. J. B. Kruskal, “Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics,” Lin. Alg. Applicat., vol. 18, no. 2, pp. 95–138, 1977.
7. N. D. Sidiropoulos and R. Bro, “On the uniqueness of multilinear decomposition of n-way arrays,” J. Chemometrics, vol. 14, no. 3, pp. 229–239, 2000.
8. T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM Rev., vol. 51, no. 3, pp. 455–500, 2009.
9. P. Comon, X. Luciani, and A. L. F. de Almeida, “Tensor decompositions, alternating least squares and other tales,” J. Chemometrics, vol. 23, no. 7-8, pp. 393–405, 2009.
10. S. Kindermann and C. Navasca, “Analysis and Approximation of the Canonical Polyadic TensorDecomposition,” ArXive-prints, Sep. 2011.
11. A. Cichocki and S. Amari, Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications. New York: Wiley, 2002.
12. C. F. Beckmann and S. M. Smith, “Tensorial extensions of independent component analysis for multisubject fMRI analysis,” NeuroImage, vol. 25, no. 1, pp. 294–311, 2005.
13. G. Zhou, A. Cichocki, and S. Xie, “Fast nonnegative matrix/tensor factorization based on low-rank approximation,” IEEE Trans. Signal Process., vol. 60, no. 6, pp. 2928–2940, 2012.
14. A. Cichocki, S. Amari, K. Siwek, and T. Tanaka, ICALAB toolbox 2007 [Online]. Available: http://www.bsp.brain.riken.jp/ICALAB
15. Z. -P. Chen, H. -L. Wu, and R. -Q. Yu, “On the self-weighted alternating trilinear decomposition algorithm-The property of being insensitive to excess factors used in calculation,” J. Chemometrics, vol. 15, no. 5, pp. 439–453, 2001.
16. B. W. Bader and T. G. Kolda, MATLAB Tensor Toolbox Version 2. 5 Feb. 2012 [Online]. Available: http://csmr.ca.sandia.gov/tgkolda/Tensor Toolbox/
17. S. A. Nene, S. K. Nayar, and H. Murase, Columbia Object Image Library (COIL-20) 1996 [Online]. Available: http://www.cs.columbia.edu/cAvE/software/softlib/coil-20.php