Comparison of lossless compression techniques

Data compression deals with representing information in a succinct way. In view that the major lossless or error-free compression methods like Huffman, arithmetic and Lempel-Ziv coding do not achieve great compression ratios, it is necessary to preprocess the images in order to reduce the amount of correlation among neighboring pixels, thereby the compression ratio is improved. These preprocessing methods could achieve reduction of image entropy in the spatial domain, or in the spatial frequency domain. The performance of some lossless compression techniques in combination with preprocessing methods is examined.<
>