An Efficient Image Compression Algorithm to Improve The Compression-Ratio of Dual-Color Image

Abstract — Success of multimedia applications demand on-line transmission of image data. This demands online compression/decompression of image data files. Spatial redundancy of an image data file are detected and removed with a simple and elegant scheme that can be easily implemented on a compression algorithm. Compression hardware having throughput that can match the capacity of high-speed data communication channel is the backbone of such on-line communication. This can be achieved by designing the compression / decompression algorithm. In this paper, we have proposed an image compression/decompression algorithm for almost dual-color images using k-means clustering, bit-map generation and run length encoding. Fuzzy C-means clustering is also used in this paper. Compression ratio and image quality (PSNR) is better in this algorithm compared to previous algorithms. The proposed algorithm is easy to implement. This algorithm not only compresses the image but also sharpens it and removes color artifacts that result at the border between two colors