{'fraction_non_alphanumeric': 0.018234165067178502, 'fraction_numerical': 0.0047984644913627635, 'mean_word_length': 5.559748427672956, '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}}
Research on image compression algorithm based on Rectangle Segmentation and storage with sparse matrix

The Quarter-tree decomposition of image compression method characters with relative simplicity and fast calculation, however compression ratio is not very high. In order to overcome this flaw, one new segmentation method named the Rectangle Segmentation is proposed, in which adjacent pixel points satisfying consistency condition are viewed as the same image block. Also, without the restriction of square which abides to 2n, the image block can be rectangle which reduces the amount of block, and improves the compression ratio. Image compression ratio can be further augmented by combining the storage method of sparse matrix. Therefore, a new image compression algorithm is proposed named the Rectangle Segmentation and Sparse Matrix Storage(RSSMS) compression algorithm. Simulation results indicate that the compression ratios of images using the new algorithm is 25.19% higher than those using the Quarter-tree decomposition method.