Color image quantization by minimizing the maximum intercluster distance

@article{Xiang1997ColorIQ,
  title={Color image quantization by minimizing the maximum intercluster distance},
  author={Zhigang Xiang},
  journal={ACM Trans. Graph.},
  year={1997},
  volume={16},
  pages={260-276}
}
  • Zhigang Xiang
  • Published 1 July 1997
  • Computer Science
  • ACM Trans. Graph.
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… 

Figures and Tables from this paper

An efficient color quantization based on generic roughness measure

Color image quantization with peak-picking and color space

Both visual and numerical evaluations reveal that the proposed color quantization approach (PPCS), able to automatically estimate an appropriate number of colors in a quantized palette, presents promising quantization results.

Color image quantization with peak-picking and color space

Both visual and numerical evaluations reveal that the proposed color quantization approach (PPCS), able to automatically estimate an appropriate number of colors in a quantized palette, presents promising quantization results.

Improving the performance of k-means for color quantization

Fast Color Quantization Using Weighted Sort-Means Clustering

  • M. E. Celebi
  • Computer Science
    Journal of the Optical Society of America. A, Optics, image science, and vision
  • 2009
The method involves several modifications to the conventional (batch) K-means algorithm, including data reduction, sample weighting, and the use of the triangle inequality to speed up the nearest-neighbor search.

Weighted MinMax Algorithm for Color Image Quantization

A new non-hierarchical color quantization technique called weighted MinMax that is a hybrid between the MinMax and Linde-Buzo-Gray algorithms is also described.

VARIANCE-CUT: A fast color quantization method based on hierarchical clustering

  • M. E. CelebiQuan Wen
  • Computer Science
    2013 International Conference on Electronics, Computer and Computation (ICECCO)
  • 2013
This paper proposes a simple yet effective color quantization method based on divisive hierarchical clustering that utilizes the commonly used binary splitting strategy along with several carefully selected heuristics that ensure a good balance between effectiveness and efficiency.

A Hybrid Color Image Quantization Algorithm Based on k-Means and Harmony Search Algorithms

Experimental results on some of the most commonly used test images in the quantization literature demonstrate that the proposed method is a powerful method, suggesting a higher degree of precision and robustness compared to existing algorithms.

An effective real-time color quantization method based on divisive hierarchical clustering

This paper proposes a simple yet effective CQ method based on divisive hierarchical clustering that utilizes the commonly used binary splitting strategy along with several carefully selected heuristics that ensure a good balance between effectiveness and efficiency.
...

References

SHOWING 1-10 OF 38 REFERENCES

New results in color image quantization

We investigate an efficient color image quantization technique that is based upon an existing binary splitting algorithm. The algorithm sequentially splits the color space into polytopal regions and

Feedback-based quantization of color images

A feedback- based strategy for color image quantization that uses an edge detector in a scaled RGB space to reveal the location and severeness of false contours, which appear in the quantized image but not in the original.

Sequential scalar quantization of color images

An efficient algorithm for color image quantization is proposed based on a new vector quantization technique that is called sequential scalar quantization, which yields high-quality images and is significantly faster than existing quantization algorithms.

Variance‐based color image quantization for frame buffer display

An algorithm for multidimensional data clustering (termed the variance-based algorithm), based on the criterion of minimization of the sum-of-squared error, is applied to the problem of reducing the number of colors used to represent a given color image.

EFFICIENT STATISTICAL COMPUTATIONS FOR OPTIMAL COLOR QUANTIZATION

A new vector quantization clustering algorithm

  • W. Equitz
  • Computer Science
    IEEE Trans. Acoust. Speech Signal Process.
  • 1989
The pairwise nearest neighbor (PNN) algorithm is presented as an alternative to the Linde-Buzo-Gray (1980, LBG) (generalized Lloyd, 1982) algorithm for vector quantization clustering. The PNN

Color image quantization for frame buffer display

It is demonstrated that many color images which would normally require a frame buffer having 15 bits per pixel can be quantized to 8 or fewerbits per pixel with little subjective degradation.

Color quantization of images

The authors develop algorithms for the design of hierarchical tree structured color palettes incorporating performance criteria which reflect subjective evaluations of image quality, which produce higher-quality displayed images and require fewer computations than previously proposed methods.

Quantization and multilevel halftoning of color images for near-original image quality

Both image-independent and image-dependent quantizers implemented in RGB or in the uniform color space L*u*υ* are considered, as well as multilevel extensions of error diffusion and ordered dither.