The development of a new error-free digital image compression algorithm is discussed. Without the help of any statistics information of the images being processed, this algorithm achieves average bits-per-word ratios near the entropy of the neighboring pixel differences. Because this algorithm does not involve statistical modeling, generation of a code book, or long integer-floating point arithmetics, it is simpler and, therefore, faster than the studied statistics codes, such as the Huffman code or the arithmetic code.
© 1992 Optical Society of America
Jackson D. He and Eustace L. Dereniak, "Error-free image compression algorithm using classifying-sequencing techniques," Appl. Opt. 31, 2554-2559 (1992)