A fast palette searching algorithm for color quantization
一种用于色彩量化的调色板快速搜索算法

An Equal-Norm Equal-Sum Palette Search (ENESPS) algorithm was proposed to speed up the color mapping step in color quantization. The palette color, whose norm was most similar to that of the pixel color to be mapped, was chosen as the initial searching point. Then the norm constraint and the sum constraint were applied to limit the searching range. Experiment results show that ENESPS can obtain shorter averaged searching length in comparison with other methods and it can reduce the computational time of color quantization remarkably.