Abstract
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
Full Article | PDF ArticleMore Like This
H. K. Huang, Shih-Chung B. Lo, Bruce K. Ho, and Shyh-Liang Lou
J. Opt. Soc. Am. A 4(5) 984-992 (1987)
Ali Bilgin, George Zweig, and Michael W. Marcellin
Appl. Opt. 39(11) 1799-1814 (2000)
J. T. Guillen-Bonilla, E. Kurmyshev, and E. González
Appl. Opt. 47(4) 541-547 (2008)