返回
Color image quantization by minimizing the maximum intercluster distance
DOI:10.1145/256157.256159.png)
摘要
En 中文
One of the numerical criteria for color image quantization is to minimize the maximum discrepancy between original pixel colors and the corresponding quantized colors. This is typically carried out by first grouping color points into tight clusters and then finding a representative for each cluster. In this article we show that getting the smallest clusters under a formal notion of minimizing the maximum intercluster distance does not guarantee an optimal solution for the quantization criterion. Nevertheless, our use of an efficient clustering algorithm by Teofilo F. Gonzalez, which is optimal with respect to the approximation bound of the clustering problem, has resulted in a fast and effective quantizer. This new quantizer is highly competitive and excels when quantization errors need to be well capped and when the performance of other quantizers may be hindered by such factors as low number of quantized colors or unfavorable pixel population distribution. Both computer-synthesized and photographic images are used in experimental comparison with several existing quantization methods.
Keyword:
algorithms
experimentation
clustering
color quantization
image compression
indexed image
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.5
论文数:
4.8K
被引数:
3.6W
机构
暂无机构信息
引用论文
Numerical Analysis of Thermal Stress for a Stack of Planar Solid Oxide Fuel Cells平板固体氧化物燃料电池堆热应力的数值分析
Energies
IF0
Development of top-level requirements for regional aircraft based on the needs of the Russian market
Calcium inflow-dependent protein kinase C activity is involved in the modulation of transmitter release in the neuromuscular junction of the adult rat
Synapse
IF0

