Improving the LZ compression algorithms on images such as LZW, through proposed Binary Cutting Algorithm

In this paper a new proposed preprocessing algorithm called Binary Cutting Algorithm (BCA) is introduced. In this method, by means of simple mathematical, the binary values of image are at first separated as high value bits and low value bits, and then high value bits are compressed through LZW algorithm. We have tested that whatever sampling depth of a file is large, the result of BCA on it will be better. Because images are stored as 24-bit and texts as 8-bit, hence, the result of BCA on images is better than text files, and because the LZW algorithm has used in the TIFF and PNG formats, so, we can improve the LZW compression via implement of BCA on TIFF and PNG images. In this method high value bits are stored through LZW via PNG format, and low value bits are stored with fix-length codes. The images of the proposed method are compressed in both lossless and lossy compression.