Skip to Main Content
Specific algorithms for lossless compression of the data, obtained after processing of halftone and color images with the inverse difference pyramid decomposition (IDP), are described in this paper. The basic steps of the IDP algorithm (coding and decoding) are defined, and the corresponding diagram for modified Huffman code generation is shown. The presented lossless run-length and modified Huffman algorithms are used together with a lossy image coding method, and are aimed at preserving the image quality after the IDP decomposition unchanged. Some practical results and comparison with the standard JPEG2000 are given also.