{'fraction_non_alphanumeric': 0.01800720288115246, 'fraction_numerical': 0.0, 'mean_word_length': 5.366412213740458, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Frequency-domain blind speech separation using incomplete de-mixing transform

We propose a novel solution to the blind speech separation problem where the de-mixing transform is estimated only within selected frequency bins. This solution is based on Independent Vector Analysis applied to a subset of instantaneous mixtures, one per selected frequency bin. Next, two approaches are proposed to complete the transform: one based on null beamforming, and the other based on convex programming. In subsequent experiments, we compare combinations of both methods and evaluate their ability to retrieve the whole de-mixing transform. Depending on the number of selected frequencies and the sparsity of room impulse responses, the methods show improvements in terms of computational complexity as well as in terms of separation accuracy.