Abstract

The purpose of color quantization is to reduce colors in an image with the least parody. Clustering is a popularly used method for color quantization. Color image quantization is an essential action in several applications of computer graphics and image processing. Most of the quantization techniques are mainly based on data clustering algorithms. In this paper, a color reduction hybrid algorithm is proposed by applying Jaya algorithm for clustering. We examine the act of Jaya algorithm in the pre-clustering stage and K-means in the post-clustering phase, and the limitations of both the algorithms are overcome by their combination. The algorithms are compared by MSE and PSNR values of the four images. The MSE values are lower and PSNR values are higher for the proposed algorithm. The results explain that the proposed algorithm is surpassed both the K-means clustering and Jaya algorithm clustering for color reduction method.

Full Text
Paper version not known

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.