计算机科学 ›› 2011, Vol. 38 ›› Issue (2): 264-266.

• 图形图像 • 上一篇    下一篇

一个基于链表的快速色彩量化算法

余庆军,余报楚,唐祯安   

  1. (大连理工大学电子与信息工程学院 大连116023) (大连东软信息学院数字艺术系 大连116023) (大连理工大学工业装备与结构分析国家重点实验室 大连116023)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受辽宁省科技计划重大研究项目(2008217004),中国博士后科学基金(200704111071)资助。

Fast Color Quantization Algorithm Based on Linked List

YU Qing-jun,YU Bao-chu,TANG Zhen-an   

  • Online:2018-11-16 Published:2018-11-16

摘要: 为了提高色彩量化算法的质量和速度,作者考虑在设计调色板的过程中充分利用分裂算法的快速性和聚类算法的准确性,试图改进像素匹配过程,然后在其基础上提出一个新的实时色彩量化算法。该算法将图像中的所有颜色按照其出现次数的大小排列成一个数据结构链表。整个色彩量化过程可视为关于该链表的一系列操作。实验结果表明,该算法能够获得期望的结果。

关键词: 色彩量化,逐对聚类,数据结构,链表

Abstract: In order to improve the quality and speed of color quantization algorithm, we took the rapidity of splitting algorithm and the accuracy of clustering algorithm into account during the design process of color palette, and tried to improve the process of pixel matching,and then proposed a new real-time color quantization algorithm. In this algorithm,all colors in an image were connected together via a data structure link according to its appearance frequency. The whole process of color quantization could be viewed as a series of operations about that data structure link. Experimental resups show that the proposed algorithm is able to achieve the expected results.

Key words: Color image quantization, Pairwise clustering, Data structure, Linked list

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!