Weighted MinMax Algorithm for Color Image Quantization
Paula J. Reitan · NASA STI Repository (National Aeronautics and Space Administration) · 1999
The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm 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 high quality quantized images with significantly less visual distortion than the MinMax algorithm. Key words and phrases: color image quantization, minimizing maximum intercluster distance, nonhierarchical clustering, image compression. 1. INTRODUCTION In color quantization a truecolor image is irreversibly transformed into a color-mapped image consisting of K carefully select...