By Topic

A New Efficient Algorithm for Lossless Binary Image Compression

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lele Zhou ; Image Processing, Graphics, and Multimedia Lab, Computer Science Department, The University of Northern British Columbia. e-mail: ; Saif Zahir

Binary image compression is desirable for a wide range of applications, such as digital libraries, map archives, fingerprint databases, facsimile, etc. In this paper, we present a new highly efficient algorithm for lossless binary image compression. The proposed algorithm introduces a new method, direct redundancy elimination, to efficiently exploit the two-dimensional redundancy of an image, as well as a novel dynamic context model to improve the efficiency of arithmetic coding. Simulation results show that the proposed algorithm has comparable compression ratio to JBIG standard. In many cases, the proposed algorithm outperforms the JBIG standard

Published in:

2006 Canadian Conference on Electrical and Computer Engineering

Date of Conference:

May 2006