HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Zibulevsky, M. Articles by Pearlmutter, B. A. Search for Related Content PubMed PubMed Citation Articles by Zibulevsky, M. Articles by Pearlmutter, B. A.

Blind Source Separation by Sparse Decomposition in a Signal Dictionary

Department of Computer Science, University of New Mexico, Albuquerque, NM 87131, U.S.A.

Barak A. Pearlmutter

Department of Computer Science and Department of Neurosciences, University of New Mexico, Albuquerque, NM 87131, U.S.A.

The blind source separation problem is to extract the underlying source signals from a set of linear mixtures, where the mixing matrix is unknown. This situation is common in acoustics, radio, medical signal and image processing, hyperspectral imaging, and other areas. We suggest a two-stage separation process: a priori selection of a possibly overcomplete signal dictionary (for instance, a wavelet frame or a learned dictionary) in which the sources are assumed to be sparsely representable, followed by unmixing the sources by exploiting the their sparse representability. We consider the general case of more sources than mixtures, but also derive a more efficient algorithm in the case of a nonovercomplete dictionary and an equal numbers of sources and mixtures. Experiments with artificial signals and musical sounds demonstrate significantly better separation than other known techniques.

This article has been cited by other articles:

				H. Asari, B. A. Pearlmutter, and A. M. Zador Sparse representations for the cocktail party problem. J. Neurosci., July 12, 2006; 26(28): 7477 - 7490. [Abstract] [Full Text] [PDF]

				S.-i. Maeda, W.-J. Song, and S. Ishii Nonlinear and Noisy Extension of Independent Component Analysis: Theory and Its Application to a Pitch Sensation Model Neural Comput., January 1, 2005; 17(1): 115 - 144. [Abstract] [Full Text] [PDF]

				Y. Li, A. Cichocki, and S.-i. Amari Analysis of Sparse Representation and Blind Source Separation Neural Comput., June 1, 2004; 16(6): 1193 - 1234. [Abstract] [Full Text] [PDF]

				K. Kreutz-Delgado, J. F. Murray, B. D. Rao, K. Engan, T.-W. Lee, and T. J. Sejnowski Dictionary Learning Algorithms for Sparse Representation Neural Comput., February 1, 2003; 15(2): 349 - 396. [Abstract] [Full Text] [PDF]

				A. C. Tang, B. A. Pearlmutter, N. A. Malaszenko, D. B. Phung, and B. C. Reeb Independent Components of Magnetoencephalography: Localization Neural Comput., August 1, 2002; 14(8): 1827 - 1858. [Abstract] [Full Text] [PDF]