By Topic

An extended run-length encoder and decoder for compression of black/white images

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
$31 $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

1 Author(s)

Most of the data compression strategies currently used for black/white (one-bit gray-scale) images involve the detection and noiseless encoding of a specified set of image features, the most common features being "runs" of adjacent equal.valued picture elements. A procedure is provided that, given the frequency distribution for a particular set of features in a sample of images, calculates an extended run-length code (ERLC) that includes two classes of codewords: "regular" codewords for the runs and "special" codewords for the other image features. An ERLC is shown to be highly efficient for the sample images, uniformly efficient for similar images not in the sample, and easily implemented. An encoder and the corresponding decoder are described which can implement any ERLC that includes up to R regular codewords and S special codewords, where R and S are design parameters. Neither the encoder nor the decoder requires a table of codewords; rather, both are controlled by two auxiliary tables that include only \ell _{\max } [\log _{2} R] -bit entries and \ell _{\max } [\log _{2} S] -bit entries, respectively, where \ell _{\max } is the length of the longest codeword.

Published in:

Information Theory, IEEE Transactions on  (Volume:22 ,  Issue: 2 )