MURAL - Maynooth University Research Archive Library

    Blind separation of sources with sparse representations in a given signal dictionary

    Zibulevsky, Michael and Pearlmutter, Barak A. (2000) Blind separation of sources with sparse representations in a given signal dictionary. In: ICA2000 : International Workshop on Independent Component Analysis and Blind Signal Separation, June 19-22, 2000, Helsinki, Finland.

    Download (198kB) | Preview

    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...

    Add this article to your Mendeley library


    The blind source separation problem is to extract the underlying source signals from a set of linear mixtures, where the mixing matrix is unknown. We consider a two-stage separation process. First, a priori selection of a possibly overcomplete signal dictionary (e.g. wavelet frame, learned dictionary, etc.) in which the sources are assumed to be sparsely representable. Second, 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 non-overcomplete dictionary and equal numbers of sources and mixtures. Experiments with artificial signals and with musical sounds demonstrate significantly better separation than other known techniques.

    Item Type: Conference or Workshop Item (Paper)
    Keywords: Blind source separation; sparse representations; signal dictionary;
    Academic Unit: Faculty of Science and Engineering > Computer Science
    Item ID: 8125
    Depositing User: Barak Pearlmutter
    Date Deposited: 05 Apr 2017 15:27
    Refereed: Yes
    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)

    View Item Item control page


    Downloads per month over past year

    Origin of downloads