A new decimation and interpolation algorithm and an efficient lossless compression technique for images

Efficient lossless compression using decimation and interpolation algorithms with low complexity and high quality is an important goal for multi-media distribution over the internet. This is because content is consumed at different sizes and over networks with different bandwidths. It is also because informational content, large screen advertisements, professional video and high quality computer animation have different quality requirements. In this paper we propose and study a novel decimation and interpolation scheme. Our method compares well in terms of PSNR with well-known Bi-cubic interpolation as well as other computationally more expensive methods available in the literature. We have compared the efficiency of our method with Bi-cubic in terms of computational complexity. In the second part of the paper we have used our decimation and interpolation scheme for developing a new lossless compression technique for images. This falls broadly under the spatial hierarchy schemes. Literature consists of many attempts to use decimation and interpolation for lossy compression of images. We have compared the efficiency of our method with Bi-cubic interpolation based approach. On an average our method has better compression efficiency than methods like lossless JPEG. Our experimental results show that ZIP, PNG and TIFF are 27%, 57% and 42% poorer in terms of compression efficiency respectively. However, this comes at the cost of increased computational complexity.