Robust Online Overdetermined Independent Vector Analysis Based on Bilinear Decomposition
Kang Chen, Xianrui Wang, Yichen Yang, Andreas Brendel, Gongping Huang, Zbyněk Koldovský, Jingdong Chen, Jacob Benesty, Shoji Makino
TL;DR
This work tackles online blind source separation in overdetermined microphone arrays by addressing parameter explosion in OverIVA through a bilinear (Kronecker-based) decomposition of each demixing filter. An alternating iterative projection framework updates the two coupled sub-filters, enabling robust online estimation with far fewer parameters. Empirical results on large arrays show approximately 10 dB improvements in SIR and SDR over conventional methods, validating the approach for real-time speech separation in noisy, reverberant environments. The BiIVA method thus offers a practical path toward scalable, robust online BSS in high-channel-count scenarios.
Abstract
Online blind source separation is essential for both speech communication and human-machine interaction. Among existing approaches, overdetermined independent vector analysis (OverIVA) delivers strong performance by exploiting the statistical independence of source signals and the orthogonality between source and noise subspaces. However, when applied to large microphone arrays, the number of parameters grows rapidly, which can degrade online estimation accuracy. To overcome this challenge, we propose decomposing each long separation filter into a bilinear form of two shorter filters, thereby reducing the number of parameters. Because the two filters are closely coupled, we design an alternating iterative projection algorithm to update them in turn. Simulation results show that, with far fewer parameters, the proposed method achieves improved performance and robustness.
