By Topic

Gray scale image compression based on multiple-valued input binary functions, Walsh and Reed-Muller spectra

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)
B. J. Falkowski ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Lip-San Lim

A new method for the lossless compression of gray scale images has been proposed. Coding of intensities is first applied to make the data more amenable for compression. A prediction process is performed followed by the mapping of prediction residuals. The prediction residuals are then split into bit planes to which the compression technique is applied. These bit planes can be coded as uncompressed, expressed as minterms or compressed using a variable block-size segmentation and coding. A dictionary of patterns is formed from simple multiple-valued input binary functions, basic Walsh, triangular Reed-Muller weights and some frequently occurring patterns. Other compression methods used in our scheme include minterm coding, coordinate data coding, Generalized k-Variable Mixed-Polarity Reed-Muller expansion and the reference row technique. The proposed scheme has been implemented in the C language and compared with other stare-of-the-art techniques

Published in:

Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on

Date of Conference: