%0 Journal Article
%T A fast palette searching algorithm for color quantization<br>一种用于色彩量化的调色板快速搜索算法
%A ZHANG Xin
%A WANG Hui
%A CAO Yuan
%A WU Ling-da
%A <br>张鑫
%A 王晖
%A 曹源
%A 吴玲达
%J 计算机应用
%D 2006
%I 
%X 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.
%K color quantization
%K vector quantization
%K color mapping
%K equal-norm equal-sum palette search<br>色彩量化
%K 矢量量化
%K 色彩映像
%K 等范数等均值调色板搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=C5CC0B3096E44060&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=708DD6B15D2464E8&sid=3D8018C5894DF14D&eid=BAF57314E6F4EA41&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=11