Research on Image Compression Algorithm Based on Deflate

Image compression is the application of data compression technology in digital images, aiming at reducing redundant information in image data and storing and transmitting data in a more efficient format. Huffman coding is a classic compression algorithm, which is a data compression algorithm based on minimum redundancy coding. Huffman tree is established and updated according to statistical character probability, and coding is constructed according to the probability of each character to reduce the space needed for storing data. Deflate compression algorithm regards all the data to be compressed as binary data stream, and the input data is encoded by LZ77, then by Huffman, and finally the compressed data is obtained. The image compression algorithm based on Deflate, which uses LZ77 algorithm and Huffman algorithm at the same time, is an algorithm for compressing data streams, with high compression speed and flexibility.