In this paper we address the problem of initial seed selection for frequency domain iterative blind speech separation (BSS) algorithms. The derivation of the seeding algorithm is guided by the goal to select samples which are likely to be caused by source activity and not by noise and at the same time originate from different sources. The proposed algorithm has moderate computational complexity and finds better seed values than alternative schemes, as is demonstrated by experiments on the database of the SiSEC2010 challenge.
Bibliographic reference. Vu, Dang Hai Tran / Haeb-Umbach, Reinhold (2011): "On initial seed selection for frequency domain blind speech separation", In INTERSPEECH-2011, 1757-1760.