The LOST Algorithm: Finding Lines and Separating Speech Mixtures. (24th September 2008)

• Record Type: Journal Article
• Authors: O'Grady O'Grady, Paul D. Paul D.; Pearlmutter Pearlmutter, Barak A. Barak A.
• Other Names: Makino Makino S. S. Academic Editor.
• Is Part Of: EURASIP journal on advances in signal processing. Volume 2008(2008)
• Publication Date: 2008-09-24
• Subjects: Signal processing -- Periodicals; Traitement du signal; Signal processing; Periodicals; 621.3822
• DOI: 10.1155/2008/784296
• Languages: English
• ISSNs: 1687-6172

Abstract

Abstract : 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 anL 1 -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.