Deakin University
Browse

Mixing Matrix Estimation From Sparse Mixtures With Unknown Number of Sources

journal contribution
posted on 2011-01-01, 00:00 authored by G Zhou, Zuyuan Yang, S Xie, J M Yang
In blind source separation, many methods have been proposed to estimate the mixing matrix by exploiting sparsity. However, they often need to know the source number a priori, which is very inconvenient in practice. In this paper, a new method, namely nonlinear projection and column masking (NPCM), is proposed to estimate the mixing matrix. A major advantage of NPCM is that it does not need any knowledge of the source number. In NPCM, the objective function is based on a nonlinear projection and its maxima just correspond to the columns of the mixing matrix. Thus a column can be estimated first by locating a maximum and then deflated by a masking operation. This procedure is repeated until the evaluation of the objective function decreases to zero dramatically. Thus the mixing matrix and the number of sources are estimated simultaneously. Because the masking procedure may result in some small and useless local maxima, particle swarm optimization (PSO) is introduced to optimize the objective function. Feasibility and efficiency of PSO are also discussed. Comparative experimental results show the efficiency of NPCM, especially in the cases where the number of sources is unknown and the sources are relatively less sparse.

History

Journal

IEEE Transactions on Neural Networks

Volume

22

Pagination

211 - 221

Location

Piscataway, N. J.

ISSN

1045-9227

eISSN

1941-0093

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2011, IEEE

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC