By Topic

An efficient image compression algorithm for almost dual-color image based on k-means clustering, bit-map generation and RLE

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)
Banerjee, A. ; Dept. of Inf. Technol., St. Thomas' Coll. of Eng. & Technol., Kolkata, India ; Halder, A.

In this paper, we have proposed an image compression/decompression algorithm for almost dual-colour images using k-means clustering, bit-map generation and run length encoding. The proposed algorithm is very simple in implementation, fast in encoding time. Experimental results show that compression ratio of this algorithm is better than our previous BOBC algorithm, dynamic BOBC-RLE algorithm and JPEG compression techniques. Image quality (PSNR) better as compared to that of the above mentioned compression techniques. In actuality the algorithm not only compresses the image but also sharpens it and removes color artefacts that result at the border between two colors.

Published in:

Computer and Communication Technology (ICCCT), 2010 International Conference on

Date of Conference:

17-19 Sept. 2010