The LOST Algorithm: Finding Lines and Separating Speech Mixtures

Robust clustering of data into linear subspaces is a frequently encountered problem. Here, we treat clustering of one-dimensional subspaces that cross the origin. This problem arises in blind source separation, where the subspaces correspond directly to columns of a mixing matrix. We propose the LOST algorithm, which identifies such subspaces using a procedure similar in spirit to EM. This line finding procedure combined with a transformation into a sparse domain and an L1-norm minimisation constitutes a blind source separation algorithm for the separation of instantaneous mixtures with an arbitrary number of mixtures and sources. We perform an extensive investigation on the general separation performance of the LOST algorithm using randomly generated mixtures, and empirically estimate the performance of the algorithm in the presence of noise. Furthermore, we implement a simple scheme whereby the number of sources present in the mixtures can be detected automatically.

[1]  Yishay Mansour,et al.  An Information-Theoretic Analysis of Hard and Soft Assignment Methods for Clustering , 1997, UAI.

[2]  Sam T. Roweis,et al.  One Microphone Source Separation , 2000, NIPS.

[3]  Juan K. Lin,et al.  Feature extraction approach to blind source separation , 1997, Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop.

[4]  Deniz Erdogmus,et al.  Underdetermined blind source separation in a time-varying environment , 2002, 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing.

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

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

[7]  Rémi Gribonval,et al.  BSS_EVAL Toolbox User Guide -- Revision 2.0 , 2005 .

[8]  L. Vielva,et al.  UNDERDETERMINED BLIND SOURCE SEPARATION USING A PROBABILISTIC SOURCE SPARSITY MODEL , 2001 .

[9]  Hiroshi Sawada,et al.  MAP-Based Underdetermined Blind Source Separation of Convolutive Mixtures by Hierarchical Clustering and -Norm Minimization , 2007, EURASIP J. Adv. Signal Process..

[10]  Jean-Francois Cardoso,et al.  Eigen-structure of the fourth-order cumulant tensor with application to the blind source separation problem , 1990, International Conference on Acoustics, Speech, and Signal Processing.

[11]  Hiroshi Sawada,et al.  Underdetermined blind sparse source separation for arbitrarily arranged multiple sensors , 2007, Signal Process..

[12]  Scott Rickard,et al.  Blind separation of speech mixtures via time-frequency masking , 2004, IEEE Transactions on Signal Processing.

[13]  Karl Pearson F.R.S..  LIII. On lines and planes of closest fit to systems of points in space , 1901 .

[14]  Barak A. Pearlmutter,et al.  Survey of sparse and non‐sparse methods in source separation , 2005, Int. J. Imaging Syst. Technol..

[15]  Pierre Comon,et al.  Independent component analysis, A new concept? , 1994, Signal Process..

[16]  Terrence J. Sejnowski,et al.  Learning Nonlinear Overcomplete Representations for Efficient Coding , 1997, NIPS.

[17]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[18]  A. Cichocki,et al.  MEASURING SPARSENESS OF NOISY SIGNALS , 2003 .

[19]  M. Hulle.  Clustering approach to square and non-square blind source separation , 1999 .

[20]  DUETScott Rickard,et al.  DOA ESTIMATION OF MANY W-DISJOINT ORTHOGONAL SOURCESFROM TWO MIXTURES USING , 2000 .

[21]  Scott Rickard,et al.  The Gini index of speech , 2004 .

[22]  Nikolaos Mitianoudis,et al.  Overcomplete source separation using Laplacian mixture models , 2005, IEEE Signal Processing Letters.

[23]  Fabian J. Theis,et al.  A geometric algorithm for overcomplete linear ICA , 2004, Neurocomputing.

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

[25]  Barak A. Pearlmutter,et al.  Soft-LOST: EM on a Mixture of Oriented Lines , 2004, ICA.

[26]  Scott T. Rickard,et al.  Maximizing Sparsity of Wavelet Representations via Parameterized Lifting , 2007, 2007 15th International Conference on Digital Signal Processing.

[27]  Elise Paschen,et al.  Poetry Speaks: Hear Great Poets Read Their Work from Tennyson to Plath , 2001 .

[28]  Barak A. Pearlmutter,et al.  Hard-LOST: modified k-means for oriented lines , 2004 .

[29]  Pau Bofill,et al.  Underdetermined blind separation of delayed sound sources in the frequency domain , 2003, Neurocomputing.

[30]  Pierre Comon.  Independent component analysis - a new concept? signal processing , 1994 .

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

[32]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[33]  Eric Moulines,et al.  A blind source separation technique using second-order statistics , 1997, IEEE Trans. Signal Process..

[34]  Scott T. Rickard,et al.  Underdetermined Blind Source Separation in Echoic Environments Using DESPRIT , 2007, EURASIP J. Adv. Signal Process..

[35]  D. Chakrabarti,et al.  A fast fixed - point algorithm for independent component analysis , 1997 .

[36]  Christian Jutten,et al.  Space or time adaptive signal processing by neural network models , 1987 .

[37]  Christian Jutten,et al.  A Geometric Approach for Separating Several Speech Signals , 2004, ICA.

[38]  Terrence J. Sejnowski,et al.  An Information-Maximization Approach to Blind Separation and Blind Deconvolution , 1995, Neural Computation.