Weighted minmax algorithm for color image quantization

摘要

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorihm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique called weighted MinMax that is a hybrid between the MinMax and Linde-Buzo-Gray (LBG) algorithms is also described. The weighted MinMax algorithm incorporates activity weighting and seeks to minimize WRMSe, whereby obtaining hgih quality quantized images with significantly less visual distortion than the MinMax algorithm.