TY - JOUR

T1 - Underdetermined Blind Source Separation with Multi-Subspace for Nonlinear Representation

AU - Wang, Lu

AU - Ohtsuki, Tomoaki

N1 - Funding Information:
This work was supported by the Keio Leading-Edge Laboratory of Science and Technology, KEIO-KLL-000045 Japan.
Publisher Copyright:
© 2013 IEEE.

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Underdetermined BSS

KW - multi-subspace representation

KW - nonlinear mixture

KW - sparse coding

KW - time-frequency representation

UR - http://www.scopus.com/inward/record.url?scp=85068984963&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068984963&partnerID=8YFLogxK

U2 - 10.1109/ACCESS.2019.2921919

DO - 10.1109/ACCESS.2019.2921919

M3 - Article

AN - SCOPUS:85068984963

VL - 7

SP - 84545

EP - 84557

JO - IEEE Access

JF - IEEE Access

SN - 2169-3536

M1 - 8733877

ER -