基于邻域搜索的快速分形图象压缩编码方法

A Fast Fractal Image Compression Coding Method Based on Neighbour-Searching

减少分形图像编码复杂性的快速算法的研究最近已成为一个重要的研究课题。在分形编码过程中 ,搜索值域块的最佳匹配的定义域块的计算量最大。因此 ,本文提出一种基于值域块邻域的快速搜索的分形编码方案。实验结果表明 ,在信噪比 (PSNR)几乎保持不变的前提下 ,提出的算法大大缩短了编码时间 。

Fast algorithms for reducing the encoding complexity of fractal image coding have recently been an important research topic. The searching computation of the best matched domain block is most heavy in the fractal encoding process. In this paper, a fast fractal approximation coding scheme is implemented on a personal computer based on matching in range block's neighbours searching. Experimental results show that the proposed algorithm is very simple in implementation, faster in encoding time and higher in compression ratio while PSNR is almost the same as compared with Barnsley's fractal block coding.