{'fraction_non_alphanumeric': 0.02207505518763797, 'fraction_numerical': 0.0007358351729212656, 'mean_word_length': 5.325581395348837, '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}}
Kalman-filtering speech enhancement method based on a voiced-unvoiced speech model

In this work, we are concerned with optimal estimation of clean speech from its noisy version based on a speech model we propose. We first propose a (single) speech model which satisfactorily describes voiced and unvoiced speech and silence (i.e., pauses between speech utterances), and also allows for exploitation of the long term characteristics of noise. We then reformulate the model equations so as to facilitate subsequent application of the well-established Kalman filter for computing the optimal estimate of the clean speech in the minimum-mean-square-error sense. Since the standard algorithm for Kalman-filtering involves multiplications of very large matrices and thus demands high computational cost, we devise a mathematically equivalent algorithm which is computationally much more efficient, by exploiting the sparsity of the matrices concerned. Next, we present the methods we use for estimating the model parameters and give a complete description of the enhancement process. Performance assessment based on spectrogram plots, objective measures and informal subjective listening tests all indicate that our method gives consistently good results. As far as signal-to-noise ratio is concerned, the improvements over existing methods can be as high as 4 dB.