Skip to main content
Log in

Center-cut for color-image quantization

  • Short Communication
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

Three simple and effective modifications made to the median-cut algorithm lead to a new and useful tool for color-image quantization. The first is to select the color box with the longest longest-dimension instead of the highest pixel count. The second is to cut through the center of the color box instead of bisecting the box's pixel count. The third is to use 3-2-4 instead of 3-3-3 bit-cutting for color reduction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • Equitz WH (1989) A new vector quantization clustering algorithm. IEEE Trans Acoustics, Speech, and Signal Processing 37(10):1568–1575

    Google Scholar 

  • Feley JD, van Dam A, Feiner SK, Hughes JF (1990) Computer graphics: principles and practice. Addison-Wesley, Reading

    Google Scholar 

  • Gervautz M, Purgathofer W (1988) A simple method for color quantization: octree quantization. In: Magnenat-Thalmann N, Thalmann D (eds) New trends in computer graphics. Springer, Berlin Heidelberg New York, pp 219–231

    Google Scholar 

  • Heckbert P (1982) Color image quantization for frame buffer display. Comput Graph 16(3):297–307

    Google Scholar 

  • Hunt RWG (1987) The Reproduction of Colour in Photography, Printing and Television. Fountain Press, Tolworth

    Google Scholar 

  • Kurz BJ (1983) Optimal color quantization for color displays. Proc IEEE Comput Vision and Pattern Recognition, pp 217–224

  • Linde Y, Buzo A, Gray RM (1980) An algorithm for vector quantizer design. IEEE Trans Communications 28(1):84–95

    Google Scholar 

  • Lindley CA (1990) Practical image processing in C Wiley, New York

    Google Scholar 

  • Pomerantz D (1990) A few good colors. Comput Language 7(8):32–41

    Google Scholar 

  • Samet H (1984) The quadtree and related hierarchical data structures. ACM Comput Surveys 16(2):187–260

    Google Scholar 

  • Tajima J (1983) Uniform color scale applications to computer graphics. Comput Vision, Graph, Image Proc 21 (3):305–325

    Google Scholar 

  • Wan SJ, Wong SKM, Prusinkiewicz P (1988) An algorithm for multidimensional data clustering. ACM Trans Mathematical Software 14(2):153–162

    Google Scholar 

  • Wu X (1991) Efficient statistical computations for optimal color quantization. In: Arvo J (ed) Graphics Gems II. Academic Press, San Diego, pp 126–133

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Joy, G., Xiang, Z. Center-cut for color-image quantization. The Visual Computer 10, 62–66 (1993). https://doi.org/10.1007/BF01905532

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01905532

Key words

Navigation