Blind source separation (BSS) is a technique to recognize the multiple talkers from the multiple observations received by some sensors without any prior knowledge information. The problem is that the mixing is always complex, such as the case where sources are mixed with some direction angles, or where the number of sensors is less than that of sources. In this paper, we propose a multi-subspace representation based BSS approach that allows the mixing process to be nonlinear and underdetermined. The approach relies on a multi-subspace structure and sparse representation in the time-frequency (TF) domain. By parameterizing such subspaces, we can map the observed signals in the feature space with the coefficient matrix from the parameter space. We then exploit the linear mixture in the feature space that corresponds to the nonlinear mixture in the input space. Once such subspaces are built, the coefficient matrix can be constructed by solving an optimization problem on the coding coefficient vector. Relying on the TF representation, the target matrix can be constructed in a sparse mixture of TF vectors with the fewer computational cost. The experiments are designed on the observations that are generated from an underdetermined mixture, and that is collected with some direction angles in a virtual room environment. The proposed approach exhibits higher separation accuracy.
ASJC Scopus subject areas
- コンピュータ サイエンス（全般）