A lossless image compression algorithm using variable block size segmentation

In this paper, we present an analysis of two image characteristics which give rise to local and global redundancy in image representation. Based on this study, we propose a lossless image compression scheme which exploits both types of redundancy. The algorithm segments the image into variable size blocks and encodes them depending on characteristics exhibited by the pixels within the block. The performance of the proposed algorithm is studied by software implementation. The proposed algorithm works better than other lossless compression schemes such as the Huffman, the arithmetic, the Lempel-Ziv and the JPEG.