A Modification of Weighted MinMax Algorithm in Color Image Quantization
碩士 === 國立交通大學 === 資訊科學系 === 90 === For image processing, the color image quantization is a useful technique to produce high quality compression image. In this thesis, we present a new color image quantization technique that modifies the weighted MinMax algorithm. It is a hybrid method of MinMax and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/89787194410527466763 |
| Summary: | 碩士 === 國立交通大學 === 資訊科學系 === 90 === For image processing, the color image quantization is a useful technique to produce high quality compression image. In this thesis, we present a new color image quantization technique that modifies the weighted MinMax algorithm. It is a hybrid method of MinMax and K-Means algorithms and based on weighted histogram. Instead of trying to solve an optimization problem, our algorithm is aiming to get the best-spread representation of the cluster in the color space. The main concept is based on minimizing the maximum intercluster distance. Unlike weighted MinMax algorithm, our method is more efficient and the quality of quantized image is good. In the mean time it is easy to implement also.
|
|---|