By Topic

Mean square error minimization using interpolative block truncation coding algorithms

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

2 Author(s)
Rhoma, E.M. ; Eng. Dept., Higher Inst. of Electron., Bani Waleed, Libya ; Abobaker, A.M.

Block Truncation Coding (BTC) is one of spatial coding techniques of images. This technique has a simple and fast algorithm which achieves constant bit rate of 2 bits per pixel. The compression ratio may be improved by coding only half of the bits in the BTC bit plane of each block; the other half will be interpolated at the receiver. The resulting bit rate will be 1.5 bits per pixel. In this paper, two proposed interpolative algorithms for coding the block truncated image bit plane are presented. Several grey scale test images are used to evaluate the coding efficiency and performance of these algorithms compared with existing algorithms. It is generally shown that the proposed algorithms give better results.

Published in:

Education Technology and Computer (ICETC), 2010 2nd International Conference on  (Volume:5 )

Date of Conference:

22-24 June 2010