Search

The important role played by the data compression is in reducing the storage space required, and ensuring bandwidth utilization in efficient manner and low transmission delays. Image compression is also a part of data compression. Images contain important data that is to be transmitted or stored. The compression must not degrade the quality of the image, and should be acceptable. This paper presents simple, low complexity image compression algorithm. Algorithm scans the image in a raster san manner in terms of 4X4 blocks. Compression is achieved by the diagonally situated pixels and indices their surrounding pixels of the block. The mages produced by proposed algorithm are high fidelity images at low PSNR values. The results are comparable with standard algorithm results. The reconstructed image quality is better than JPEG images at same PSNR.

Images consume more space when stored and use a lot of bandwidth during transmission. Hence, an image compression reduces storage space required, and time to transmit an image by making effective usage of bandwidth. In this paper, a simple image compression method using an index-based approach is proposed. This approach makes use of simple indices of an array to compress images. The context of nearby fifteen pixels is used, and the index for the current pixel is found. The indices are found for every pixel of an image. These indices are transformed and written into a transformed file. This transformed file is further compressed with Huffman compression to achieve a compressed file. Decompression uses a simple methodology to reconstruct the image. The pixel value is reconstructed using the index, and from previously reconstructed pixels of the image. The proposed algorithm provides high fidelity images at lower Peak Signal to Noise Ratio (PSNR). The results obtained from the proposed algorithm are compared with JPEG algorithm. At the same PSNR values, the quality of the reconstructed images by the proposed algorithm is comparable to that of the JPEG algorithm.

Data compression is the way of reducing the number of bits required to store and efficiently utilize bandwidth during the transmission of data over a network channel. Image compression is also having importance as images contain important binary data to represent as image and that is to be stored and transmitted. The compression of an image must not reduce the quality of the image except in some cases. This paper proposes a compression algorithm with low PSNR, high fidelity images. The algorithm alienates the input image as non-overlapping blocks of size 4*4. Compression is achieved by using diagonally situated pixels and other adjacent pixels of the blocks. The decompression uses a simple approach. The diagonally situated pixels and other adjacent pixels are used to reconstruct images in decompression phase. The proposed algorithm reconstructs images with high fidelity at lower Peak Signal to Noise Ratio (PSNR). The results of proposed algorithm are compared with JPEG. Results have shown that at same PSNR values, reconstructed image quality by the proposed algorithm is better than that of the JPEG algorithm.