{'fraction_non_alphanumeric': 0.020214030915576695, 'fraction_numerical': 0.0, 'mean_word_length': 5.145985401459854, '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}}
Time-frequency domain blind source separation - the independence problem and proposed solution

Time-frequency domain blind source separation (BSS) leads to a seldom mentioned but important problem that generally the independence assumption between source signals collapses in the frequency domain due to inadequate samples. It consequently degrades the performance of all the ICA-based BSS methods. In this paper, we set up a criterion on the performance of separation at each frequency bin and propose a recursive algorithm to correct the bin separations which are thought improper. The bin mixtures are separated into the components of the sources as practical instead of the "independent" bins as achieved by the conventional ICA. The signal-to-noise ratio is greatly increased at certain bins, which results in a much better separation.