{'fraction_non_alphanumeric': 0.01600985221674877, 'fraction_numerical': 0.0, 'mean_word_length': 5.504, '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}}
An improved EZW algorithm based on set partitioning in hierarchical trees using wavelet regularity

This paper presents an improved embedded zerotree wavelet (EZW) coding algorithm, which makes use of the wavelet regularity to derive a classification criterion of wavelet coefficients in spatial-orientation hierarchical trees. Variations of the EZW algorithm discussed in the open literature have proposed some modifications in the process of exploiting the similarity of coefficients through the scales, however, not defining a figure of merit to measure such a similarity. Simulation results achieved from the coding of well-known images in the literature, for several bit rates, show a better performance of the proposed algorithm in both PSNR and subjective terms, as compared with EZW and SPIHT algorithms.