{'fraction_non_alphanumeric': 0.018410852713178296, 'fraction_numerical': 0.0, 'mean_word_length': 5.45625, '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 Image Compression Scheme Adopted for Contourlet Transform

Set partitioning in hierarchical trees (SPIHT) image compression algorithm based on Wavelet Transform can't effectively express the image of the texture and contour. Contourlet transform can retain image details better because it avoids down sampling to high-frequency subband, and the coefficient is also sparser than it of wavelet transform. In this paper, a suitable SPIHT algorithm for contourlet transform was proposed for its coefficient matrix characteristics and distribution. The new algorithm not only overcome the disadvantage of not protecting details and texture effectively when using wavelet transform, but also saves coding time, at the same time enhance the image of the peak signal to noise ratio (PSNR). Simulation results show that the method is an efficient image compression algorithm. Its compression effect is obviously better than traditional SPIHT algorithms based on wavelet transform and WBCT (especially at low bit rates). It has generality.