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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
