On the WWW, the transmission time for videos and images impacts the performance of a web site. In order to reduce the bandwidth that is used to transmit images over the Internet, most image formats adopt only a limited number of colors used simultaneously to display color images on a video monitor. Hence, generating a good color palette for a color digitized image is an important task for Internet applications. In general, the Linde-Buzo-Gray (LBG) algorithm can be used to cluster a color digitized image in which each pixel is considered as a 3-dimension vector in an RGB color space for generating a color palette. The codebook generated by the LBG algorithm can be considered as the color palette for the color image. In order to obtain a good color palette, the LEG algorithm needs a large amount of computation time. In this paper, we propose a color finite-state LBG (CFSLBG) algorithm that reduces the computation time by exploiting the correlations of palette entries between the current and previous iterations. Instead of searching the whole color palette, the CFSLBG algorithm searches only a small number of colors that are very close to the training vector. Thus, the computation time for color quantization is reduced. The proposed approach generates RGB palettes efficiently with little sacrifice of quantized image quality. This paper describes the implementation of this work and simulation results.
Relation:
Journal of Information Science and Engineering Volume 20, Issue 4, July 2004, Pages 771-782
