Zhigang Xiang
Abstract
One of the numerical criteria for color image quantization is to minimize the maximum discrepancy between original pixel colors and the corresponding quantized colors. This is typically carried out by first grouping color points into tight clusters and then finding a representative for each cluster. In this article we show that getting the smallest clusters under a formal notion of minimizing the maximum intercluster distance does not guarantee an optimal solution for the quantization criterion. Nevertheless our use of an efficient clustering algorithm by Teofilo F. Gonzalez, which is optimal with respect to the approximation bound of the clustering problem, has resulted in a fast and effective quantizer. This new quantizer is highly competitive and excels when quantization errors need to be well capped and when the performance of other quantizers may be hindered by such factors as low number of quantized colors or unfavorable pixel population distribution. Both computer-synthesized and photographic images are used in experimental comparison with several existing quantization methods.
- BALASUBRAMANIAN, R., BOUMAN, C. A., AND ALLEBACH, J.P. 1992. New results in color image quantization. In Proceedings of SPIE 1657, 289-303.Google Scholar
- BALASUBRAMANIAN, R., BOUMAN, C. A., AND ALLEBACH, J.P. 1994. Sequential scalar quantization of color images. J. Electron. Imag. 3, 1, 45-59.Google Scholar
- BRUCKER, P. 1978. On the complexity of clustering problems. In Optimization and Operations Research, R. Henn, B. Korte, and W. Oettli, Eds., Springer-Verlag, Berlin, 45-54.Google Scholar
- CRINON, R.J. 1991. Picture compression based on two-dimensional adaptive sampling and adaptive quantization. Optic. Eng. 30, 10, 1490-1496.Google Scholar
- EQUITZ, W.H. 1989. A new vector quantization clustering algorithm. IEEE Trans. Acoustics, Speech, Signal Process. 37, 10, 1568-1575.Google Scholar
- FLOYD, R. AND STEINBERG, L. 1975. An adaptive algorithm for spatial gray scale. In Society for Information Display 1975 International Symposium Digest of Technical Papers, 36-37.Google Scholar
- GAREY, M. R. AND JOHNSON, D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York. Google Scholar
- GAREY, M. R., JOHNSON, D. S., AND WITSENHAUSEN, H. S. 1982. The complexity of the generalized Lloyd-Max problem. IEEE Trans. Inf. Theory IT-28, 2, 255-256.Google Scholar
- GENTILE, R. S., ALLEBACH, J. P., AND WALOWIT, E. 1990a. Quantization of color images based on uniform color spaces. J. Imag. Technol. 16, 1, 11-21.Google Scholar
- GENTILE, R. S., WALOWIT, E., AND ALLEBACH, J. P. 1990b. Quantization and multilevel halftoning of color images for near original image quality. In Proceedings of SPIE 1249: Human Vision and Electronic Imaging (Santa Clara, CA, Feb. 12-14), 249-260.Google Scholar
- GERVAUTZ, M. AND PURGATHOFER, W. 1988. A simple method for color quantization: Octree quantization. In New Trends in Computer Graphics, N. Magnenat-Thalmann and D. Thalmann, Eds., Springer-Verlag, Berlin, 219-231.Google Scholar
- GIUSTO, D. D., REGAZZONI, C. S., SERPICO, S. B., AND VERNAZZA, G. 1990. A new adaptive approach to picture coding. Annales Telecommun. 45, 9-10, 503-518.Google Scholar
- GONZALEZ, T.F. 1985. Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 2-3, 293-306.Google Scholar
- GRAY, R. M., KIEFFER, J. C., AND LINDE, Y. 1980. Locally optimal block quantizer design. Inf. Control 45, 178-198.Google Scholar
- HECKBERT, P. 1982. Color image quantization for frame buffer display. Comput. Graph. 16, 3, 297-307. Google Scholar
- JoY, G. AND XIANG, Z. 1993. Center-cut for color image quantization. Visual Comput. 10, 1, 62-66. Google Scholar
- JoY, G. AND XIANG, Z. 1996. Reducing false contours in quantized color images. Comput. and Graph. 20, 2, 231-242.Google Scholar
- KASSON, g. M. AND PLOUFFE, W. 1992. An analysis of selected computer interchange color spaces. ACM Trans. Graph. 11, 4, 373-405. Google Scholar
- KURZ, B.J. 1983. Optimal color quantization for color displays. In IEEE Proceedings of Computer Vision and Pattern Recognition, 217-224.Google Scholar
- LINDE, Y., Buzo, A., AND GRAY, R.M. 1980. An algorithm for vector quantizer design. IEEE Trans. Commun. 28, 1, 84-95.Google Scholar
- LLOYD, S. P. 1957. Least squares quantization in PCM. Unpublished Bell Laboratories memorandum; also IEEE Trans. Inf. Theory IT-28 (1982), 129-137.Google Scholar
- MAHY, M., VAN MELLAERT, B., VAN EYCKEN, L., AND OOSTERLINCK, A. 1991. The influence of uniform color spaces on color image processing: A comparative study of CIELAB, CIELUV, and ATD. J. Imag. Technol. 17, 5, 232-243.Google Scholar
- MAX, J. 1960. Quantizing for minimum distortion. IRE Trans. Inf. Theory IT-6, 7-12.Google Scholar
- ORCHARD, M. T. AND BOUMAN, C.A. 1991. Color quantization of images. IEEE Trans. Signal Process. 39, 12, 2677-2690.Google Scholar
- SAHNI, S. AND GONZALEZ, T. 1976. P-complete approximation problems. J. ACM 23, 3, 555-565. Google Scholar
- SELIM, S. Z. AND ISMAIL, M.A. 1984. K-means-type algorithms: A generalization convergence theorem and characterization of local optimality. IEEE Trans. Pattern Anal. Mach. Intel. PAMI-6, 1, 81-87.Google Scholar
- ULICHNEY, R. 1987. Digital Halftoning. MIT Press, Cambridge, MA. Google Scholar
- WAN, S. J., PRUSINKIEWICZ, P., AND TONG, S. K. M. 1990. Variance-based color image quantization for frame buffer display. Color Res. Appl. 15, 1, 52-58.Google Scholar
- Wu, X. 1991. Efficient statistical computations for optimal color quantization. In Graphics Gems H, J. Arvo, Ed., Academic Press, San Diego, CA, 126-133.Google Scholar
- Wu, X. 1992. Color quantization by dynamic programming and principal analysis. ACM Trans. Graph. 11,4, 348-372. Google Scholar
- XIANG, Z. AND JoY, G. 1994a. Color image quantization by agglomerative clustering. IEEE Comput. Graph. Appl. 14, 3, 44-48. Google Scholar
- XIANG, Z. AND JoY, G. 1994b. Feedback-based quantization of color images. In Proceedings of SPIE 2182: Image and Video Processing H (San Jose, CA, Feb. 7-9, 1994), 34-42.Google Scholar
Index Terms
- Color image quantization by minimizing the maximum intercluster distance
Recommendations
An efficient color quantization based on generic roughness measure
Color quantization is a process to compress image color space while minimizing visual distortion. The quantization based on preclustering has low computational complexity but cannot guarantee quantization precision. The quantization based on ...
Color image quantization with peak-picking and color space
AbstractColor image quantization is a significant procedure of reducing the huge range of color values of a digital color image into a limited range. In this paper, an automated clustering of pixels and color quantization algorithm is proposed. The ideal ...
Colour quantization with Ant-tree
Graphical abstractDisplay Omitted HighlightsThe Ant-tree clustering algorithm is adapted for colour quantization.The algorithm performs the two basic operations of colour quantization.A threshold determines if a pixel is associated to the most similar ...
Comments