{'fraction_non_alphanumeric': 0.021216407355021217, 'fraction_numerical': 0.011315417256011316, 'mean_word_length': 5.4363636363636365, '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}}
Packed integer wavelet transform constructed by lifting scheme

A new method for speeding up the integer reversible wavelet transforms constructed by the lifting scheme is proposed. The proposed method packs multiple pixels (wavelet coefficients) in a single word; therefore, it can make use of the 32-bit or 64-bit computational capability of modern computers to accomplish multiple addition/subtraction operations in one instruction cycle. As a result, the proposed method can save the decomposition/reconstruction time by up to 37 percent on 32-bit machines in comparison with the original wavelet transform algorithms. Furthermore, the packed integer wavelet transform requires much less working memory.