{'fraction_non_alphanumeric': 0.044926413632842756, 'fraction_numerical': 0.001549186676994578, 'mean_word_length': 4.953917050691245, '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}}
Quasi-Interpolation by Means of Filter-Banks

We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated version of a linear combination of shifted versions of a kernel ¿(t), specifically fapprox T(t) = ¿af[n]¿(t/T - n), in a way that the polynomials of degree at most L-1 are recovered exactly. These approximation schemes give order L, i.e., the error is O(TL) where T is the sampling period. Recently, quasi-interpolation schemes using a discrete prefiltering of the samples f(nT) to obtain the coefficients af[n], have been proposed. They provide tight approximation with a low computational cost. In this work, we generalize considering rational filter banks to prefilter the samples, instead of a simple filter. This generalization provides a greater flexibility in the design of the approximation scheme. The upsampling and downsampling ratio r of the rational filter bank plays a significant role. When r = 1, the scheme has similar characteristics to those related to a simple filter. Approximation schemes corresponding to smaller ratios give less approximation quality, but, in return, they have less computational cost and involve less storage load in the system.