Abstract

Image compression is a process that reduces memory space required to store an image. The image compression techniques are broadly classified into two categories a) Lossless technique b) Lossy technique. Lossy compression technique achieves higher result, but due to data loss it may cause spatial in consistency, blocking artifact, quantization noise in the decompressed image degrading the image quality. Most of the existing compression techniques are applicable on single image separately. In this study an image compression method is proposed where multiple images of the same size are combined together and compressed to achieve higher compression ratio while keeping image quality as close as standard image compression techniques. Luminance channel of each image is compressed separately using Vector Quantization (VQ) algorithm while two chrominance channels, Cb and Cr of all images are combined into a three dimensional matrix that forms training vector. Clustering is applied on the training vector to get the initial color representatives. Thus, for the chrominance channels of n number of images, the proposed method generates one index matrix and one centroid matrix of size 256×2× n where 256 is the number of clusters. This centroid matrix contains one 256×2 dimensional centroid matrix for each individual image. This 256×2 matrix contains centroid of each cluster. The centroids of each and every cluster of an image are updated individually using optimization technique to get a better centroid (Cb, Cr) pair. This process updates the color representative pair of Cb and Cr further. This method has been applied on standard images in literature and images collected from UCID v. 2 color image database. Experimental results are analyzed in terms of PSNR and space reduction. Experimental results show that the proposed method achieves a higher compression ratio retaining almost similar image information as other standard lossy compression algorithm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.