{'fraction_non_alphanumeric': 0.038901601830663615, 'fraction_numerical': 0.0, 'mean_word_length': 5.25, '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}}
Blind separation for instantaneous mixture of speech signals: algorithms and performances

Because it can be found in many applications, the blind separation of sources (BSS) problem has raised an increasing interest. According to the BSS, one should estimate some unknown signals (named sources) using multisensor output signals (i.e., observed or mixing signals). For the blind separation of sources (BSS) problem, many algorithms have been proposed in the last decade. Most of these algorithms are based on high order statistics (HOS) criteria. In this paper, we focus on the blind separation of nonstationary signals (music, speech signal, etc.) from their linear mixtures. At first, we present briefly the idea behind the separation of nonstationary sources using second order statistics (SOS). After that, we introduce and compare three possible separating algorithms.