| Summary: | 碩士 === 國立臺灣大學 === 電信工程學研究所 === 96 === The color image quantization expects that a color image can use less number of representative colors to represent it and the human eyes can not notice. It is helpful when the output do not have enough colors to display. Also, it can save storage memory and the transmit time. Thus the color image quantization is an important issue in nowadays.
In this thesis, we will introduce four kinds of image quantization algorithms. The pervious two are well-know: the median-cut and the center-cut algorithm. The cutting plane is decided by balancing populations. The third one is called quantization using distances between adjacent colors algorithm which wishes to minimal the total quantization errors. The Fourth one is quantization by preserving color distribution features, which want to keep the color distribution unchanged. By preserving the same color distributions, we also do some applications.
Last, we will illustrate a color image dequantization algorithm which is blind. It will improve the color contours and make the quantized color image looks like an original one.
|
|---|
