Open Access
Subscription Access
Pixel Size Reduction Loss-Less Image Compression Algorithm
The digital signal processing and multimedia Computing is used to produce and process a large number images. Storing of raw image takes more space on storage device and more bandwidth over network during transmission. Very few image compression algorithms exist in loss-less image compression category to achieve compression ratio without transforming the image from the spatial domain. This paper proposes new spatial domain loss-less image compression algorithm for synthetic color images of 24 bits. The proposed algorithm does compression of an image by reducing the size of pixel. The size of pixel is reduced by representing pixel using only required number of bits instead of 8 bits per color. The pre-processing step takes care of re-valuing pixel based on occurrence to get better compression ratio. The proposed algorithm has been applied on set of test images and the results obtained are encouraging. The compression ratio has been compared with Huffman, TIFF, PPM-Tree, GPPM, PCX [19] and found better.
Keywords
Pixel Size Reduction, Bits Per Pixel, Run Length Encoding, Huffman Encoder, Loss-Less Image Compression and Compression Ratio.
User
Font Size
Information
Abstract Views: 265
PDF Views: 136