Skip to main content

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.

Publisher note

To access the full article, please see PDF.

Author information



Corresponding author

Correspondence to Paul D. O'Grady.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

O'Grady, P.D., Pearlmutter, B.A. The LOST Algorithm: Finding Lines and Separating Speech Mixtures. EURASIP J. Adv. Signal Process. 2008, 784296 (2008).

Download citation


  • Linear Subspace
  • Full Article
  • Blind Source Separation
  • Separation Performance
  • Publisher Note