Estimating the mixing matrix in Sparse Component Analysis (SCA) based on partial k-dimensional subspace clustering

One of the major problems in underdetermined Sparse Component Analysis (SCA) in the field of (semi) Blind Source Separation (BSS) is the appropriate estimation of the mixing matrix, A, in the linear model X=AS, especially where more than one source is active at each instant of time. Most existing algorithms require the restriction that at each instant (i.e. in each column of the source matrix S), there is at most one single dominant component. Moreover, these algorithms require that the number of sources must be determined in advance. In this paper, we proposed a new algorithm for estimating the matrix A, which does not require the restriction of single dominant source at each instant. Moreover, it is not necessary that the exact number of sources be known a priori.

[1]  M. Elad,et al.  $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.

[2]  Christian Jutten,et al.  Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem , 2007, ICA.

[3]  Andrzej Cichocki,et al.  On-Line K-PLANE Clustering Learning Algorithm for Sparse Comopnent Analysis , 2006, 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings.

[4]  Erkki Oja,et al.  Independent Component Analysis , 2001 .

[5]  Yuanqing Li,et al.  Analysis of Sparse Representation and Blind Source Separation , 2004, Neural Computation.

[6]  Kiyotoshi Matsuoka,et al.  A neural net for blind separation of nonstationary signals , 1995, Neural Networks.

[7]  Fabian J. Theis,et al.  Blind source separation and sparse component analysis of overcomplete mixtures , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[8]  L. Vielva,et al.  INVERSION TECHNIQUES FOR UNDERDETERMINED BSS IN AN ARBITRARY NUMBER OF DIMENSIONS , 2002 .

[9]  Christian Jutten,et al.  Semi-Blind Approaches for Source Separation and Independent component Analysis , 2006, ESANN.

[10]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[11]  D. Donoho For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[12]  S. Amari,et al.  SPARSE COMPONENT ANALYSIS FOR BLIND SOURCE SEPARATION WITH LESS SENSORS THAN SOURCES , 2003 .

[13]  Rémi Gribonval,et al.  A survey of Sparse Component Analysis for blind source separation: principles, perspectives, and new challenges , 2006, ESANN.

[14]  Christian Jutten,et al.  A Fast Method for Sparse Component Analysis Based on Iterative Detection‐Estimation , 2006 .

[15]  Barak A. Pearlmutter,et al.  Independent Component Analysis: Blind source separation by sparse decomposition in a signal dictionary , 2001 .

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

[17]  Michael Zibulevsky,et al.  Underdetermined blind source separation using sparse representations , 2001, Signal Process..

[18]  Adel Belouchrani,et al.  Maximum Likelihood Source Separation By the Expectation-Maximization Technique: Deterministic and St , 1995 .

[19]  Terrence J. Sejnowski,et al.  Blind source separation of more sources than mixtures using overcomplete representations , 1999, IEEE Signal Processing Letters.

[20]  Barak A. Pearlmutter,et al.  Blind Source Separation by Sparse Decomposition in a Signal Dictionary , 2001, Neural Computation.

[21]  Fabian J. Theis,et al.  Sparse component analysis and blind source separation of underdetermined mixtures , 2005, IEEE Transactions on Neural Networks.

[22]  Schuster,et al.  Separation of a mixture of independent signals using time delayed correlations. , 1994, Physical review letters.

[23]  A. Papoulis Probability and Statistics , 1989 .

[24]  Barak A. Pearlmutter,et al.  Blind source separation by sparse decomposition , 2000, SPIE Defense + Commercial Sensing.

[25]  R. Liu,et al.  AMUSE: a new blind identification algorithm , 1990, IEEE International Symposium on Circuits and Systems.