1 August 2007 Compression rates comparison of entropy coding for three-bit chain codes of bilevel images
Luis Echávarri Aguinaga, Ricardo A. Neri-Calderón, Ramon M. Rodriguez-Dagnino
Author Affiliations +
Abstract
We carried out a comparative study between different entropy coding schemes applied to bilevel images. The study was centered on their application to reduce existing redundancies in the three-bit chain code used to compress bilevel images. We propose a variant of the run-length codes using joint runs of two symbols at the same time. According to our results, the number of bits needed to store chain codes is reduced more than 50% over the case that is not compressed, and a 45% improvement is achieved over the results obtained with classical Huffman coding.
©(2007) Society of Photo-Optical Instrumentation Engineers (SPIE)
Luis Echávarri Aguinaga, Ricardo A. Neri-Calderón, and Ramon M. Rodriguez-Dagnino "Compression rates comparison of entropy coding for three-bit chain codes of bilevel images," Optical Engineering 46(8), 087007 (1 August 2007). https://doi.org/10.1117/1.2771241
Published: 1 August 2007
Lens.org Logo
CITATIONS
Cited by 10 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image compression

Computer programming

Optical engineering

Binary data

Data compression

Optical tracking

Image processing

Back to Top