Share Email Print
cover

Optical Engineering

Compression rates comparison of entropy coding for three-bit chain codes of bilevel images
Author(s): Luis Echávarri Aguinaga; Ricardo A. Neri-Calderón; Ramon M. Rodriguez-Dagnino
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 August 2007
PDF: 7 pages
Opt. Eng. 46(8) 087007 doi: 10.1117/1.2771241
Published in: Optical Engineering Volume 46, Issue 8
Show Author Affiliations
Luis Echávarri Aguinaga, Instituto Tecnológico y de Estudios Superiores de Monterrey (Mexico)
Ricardo A. Neri-Calderón, Instituto Tecnológico y de Estudios Superiores de Monterrey (Mexico)
Ramon M. Rodriguez-Dagnino, Instituto Tecnológico y de Estudios Superiores de Monterrey (Mexico)


© SPIE. Terms of Use
Back to Top