{'fraction_non_alphanumeric': 0.018590998043052837, 'fraction_numerical': 0.0, 'mean_word_length': 5.354037267080745, '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}}
A generalized weighted median filter structure admitting real-valued weights

Weighted median filters (smoothers) have been shown to be analogous to normalized FIR linear filters constrained to have only positive weights. In this paper, it is shown that much like the mean is generalized to the rich class of linear FIR fillers, the median can be generalized to a richer class of weighted median (WM) filters admitting positive and negative weights. The generalization follows naturally and is surprisingly simple. In order to analyze and design this class of WM filters, a new threshold decomposition theory admitting real-valued input signals is developed which, in turn, is used to develop fast adaptive algorithms to optimally design the real-valued filter coefficients. The new WM filter formulation leads to significantly more powerful estimators capable of effectively addressing a number of fundamental problems in signal processing which could not adequately be addressed by prior WM filter (smoother) structures.