By Topic

Lossy compression of images using logic minimization

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

4 Author(s)
Augustine, J. ; Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada ; Lynch, W. ; Yuke Wang ; Al-Khalili, A.J.

A technique for lossy compression of images is presented, utilizing ideas of logic minimization. The approach specifically addresses the compression of the binary image data originated in block truncation coding (BTC). The binary vector corresponding to a block of 4×4 pixels is treated as the output of a Boolean function and prime cubes are generated. The largest prime cube is encoded. Bit rate less than 1.5 bits/pel is attained in BTC without many perceivable errors in the reconstructed grey scale image. Training, pre-stored tables or codebooks, and prior knowledge of the image source are not required by the technique which uses simple logic operations. Computational simplicity of the algorithm makes it suitable for VLSI implementation. Potential of the technique in attaining a rate less than 0.5 bit/pel by applying it on image sequences and extending to blocks of larger size is indicated

Published in:

VLSI Design, 1999. Proceedings. Twelfth International Conference On

Date of Conference:

7-10 Jan 1999