Computationally-Efficient Overdetermined Blind Source Separation Based on Iterative Source Steering

Yicheng Du

doi:10.1109/LSP.2021.3134939

Return

Computationally-Efficient Overdetermined Blind Source Separation Based on Iterative Source Steering

2022-01-01

PRE

DOI：10.1109/LSP.2021.3134939

Original

Original request for help

Save

Abstract

En 中文

This paper describesa computationally-efficient optimization algorithm for the blind source separation (BSS) of overdetermined mixtures. In the determined case, a matrix-inversion-free iterative source steering (ISS) algorithm has been proposed for estimating a square demixing matrix as a computationally-efficient alternative to the popular iterative projection (IP) algorithm. The IP algorithm is based on source-wise (i.e., row-wise) updates of the demixing matrix, and lends itself naturally to an extension to overdetermined independent vector analysis (IVA) called OverIVA. In contrast, the ISS algorithm changes the whole demixing matrix at every update, making its extension to the overdetermined case non-trivial. In this paper, we propose a modified ISS algorithm for OverIVA fully exploiting the computational savings of ISS. We also derive an overdetermined extension of independent low-rank matrix analysis (OverILRMA) with the modified ISS algorithm. Experimental results showed that the proposed ISS-based OverIVA and OverILRMA were comparable or superior to the conventional IP-based counterparts in speech separation performance while achieving lower computational cost.

Keywords:

Signal processing algorithms

IP networks

Iterative algorithms

Blind source separation

Parameter estimation

Microphones

Cost function

Overdetermined blind source separation

independent vector analysis

fast algorithm