Title :
An efficient image compression algorithm for almost dual-color image based on k-means clustering, bit-map generation and RLE
Author :
Banerjee, Adrish ; Halder, Abhishek
Author_Institution :
Dept. of Inf. Technol., St. Thomas´ Coll. of Eng. & Technol., Kolkata, India
Abstract :
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.
Keywords :
data compression; image coding; image colour analysis; pattern clustering; almost dual-color image; bit-map generation; image compression algorithm; image quality; k-means clustering; run length encoding; Algorithm design and analysis; Clustering algorithms; Heuristic algorithms; Image coding; Image color analysis; Pixel; Transform coding; Almost dual-color images; Bit-map generation; K-means clustering; Run-length encoding;
Conference_Titel :
Computer and Communication Technology (ICCCT), 2010 International Conference on
Conference_Location :
Allahabad, Uttar Pradesh
Print_ISBN :
978-1-4244-9033-2
DOI :
10.1109/ICCCT.2010.5640529