{'fraction_non_alphanumeric': 0.011061946902654867, 'fraction_numerical': 0.0, 'mean_word_length': 5.373239436619718, '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 SPIHT algorithm based on wavelet coefficient blocks for image coding

An improved set partition in hierarchical trees (SPIHT) algorithm based on wavelet coefficient blocks is presented for image coding. According to the algorithm characteristic of traditional SPIHT that scanning once can process four wavelet coefficients, our approach is to divide the wavelet transform coefficient matrix into corresponding coefficient blocks and encodes every block with different strategy. When the maximum value of the coefficient block is less than the current threshold, only one bit is used for coding, thus to decrease the number of comparison and reduce the loss of coding efficiency caused by repeat coding and early coding for non-important coefficients. Analysis and simulation results show that the proposed algorithm can provide a better peak signal to noise ratio performance at low bit rate.