| 一种基于K-均值聚类优化的快速分形图像压缩算法 |
| |
| 引用本文： | 姜政,江铭炎.一种基于K-均值聚类优化的快速分形图像压缩算法[J].电气电子教学学报,2006,28(2):44-46,60. |
| |
| 作者姓名： | 姜政 江铭炎 |
| |
| 作者单位： | 山东大学,信息科学与工程学院,山东,济南,250100;山东大学,信息科学与工程学院,山东,济南,250100 |
| |
| 摘 要： | 提出了一种基于K-均值聚类的快速分形图像压缩算法，对搜索窗中的父块和子块，根据其方差的不同，用K-均值聚类方法分别对子块和父块进行聚类，子块只对同一类中的父块进行匹配，从而大大缩短了编码时间。实验结果表明，与经典分形压缩算法相比，本文算法编码速度可提高5倍；同基于方差的快速分形压缩算法相比，本文算法也有明显的优势。
|
| 关 键 词： | K-均值聚类 分形块编码 图像压缩 |
| 文章编号： | 1008-0686（2006）02-0044-04 |
| 收稿时间： | 2005-11-30 |
| 修稿时间： | 2005-11-302006-02-18 |
A Fast Fractal Image Compression Algorithm Based on K-mean Clustering Optimization |
| |
| JIANG Zheng,JIANG Ming-yan.A Fast Fractal Image Compression Algorithm Based on K-mean Clustering Optimization[J].Journal of Electrical & Electronic Engineering Education,2006,28(2):44-46,60. |
| |
| Authors: | JIANG Zheng JIANG Ming-yan |
| |
| Affiliation: | School of Information Science and Engineering, Shandong University, Jinan 250100, China |
| |
| Abstract: | In this paper,an accelerating algorithm based on K-mean clustering is proposed for fractal image encoding.Range and domain blocks are clustered by using K-mean clustering method,and range blocks search domain blocks in the same category,which can shorten encoding time significantly.The encoding speed of our method is 5 times faster than that of the classical Jacquin's algorithm.We also teste some other fast encoding schemes based on variance,and the experiment results show that our algorithms are superior to them. |
| |
| Keywords: | K-mean clustering fractal block coding image compression |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
