Zibulevsky, Michael and Pearlmutter, Barak A. (1999) Blind Source Separation by Sparse Decomposition. Technical Report. University of New Mexico Technical Report No. CS99-1.
Preview
BP-Blind-1999.pdf
Download (990kB) | Preview
Abstract
The blind source separation problem is to extract the underlying source signals from a set of their linear mixtures, where the mixing matrix is unknown. This situation is common, eg in acoustics, radio, and medical signal processing. We exploit the property of the sources to have a sparse representation in a corresponding (possibly overcomplete) signal dictionary. Such a dictionary may consist of wavelets, wavelet packets, etc., or be obtained by learning from a given family of signals. Starting from the maximum posteriori framework, which is applicable to the case of more sources than mixtures, we derive a few other categories of objective functions, which provide faster and more computations, when there are an equal number of sources and mixtures. Our experiments with artificial signals and with musical sounds demonstrate significantly better separation than other known techniques.
Item Type: | Monograph (Technical Report) |
---|---|
Keywords: | Blind Source Separation; Sparse Decomposition; |
Academic Unit: | Faculty of Science and Engineering > Computer Science |
Item ID: | 8166 |
Depositing User: | Barak Pearlmutter |
Date Deposited: | 26 Apr 2017 12:14 |
Publisher: | University of New Mexico Technical Report No. CS99-1 |
URI: | https://mural.maynoothuniversity.ie/id/eprint/8166 |
Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only (login required)
Downloads
Downloads per month over past year