一种改进的空间域快速分形图像压缩算法
Modified Fast Fractal Image Compression Algorithm in spatial domain
摘要：
本文提出了一种新的分形图像压缩算法，大大缩短了编码时间。该算法利用域池减少方法，以及使用创新的预定义值的对比度缩放因子，S，而不是搜索它在[0，1]。只有熵大于阈值的域块才被认为是域池。作为一个新颖的点，它是假设在编码过程的每一步中，具有足够小的距离的域块应被发现，只有范围块具有低活动性（相当于低熵）。这个新的点被用来找到S的合理估计，并在编码过程中使用它们作为预定义的值，如上所述，剩余的范围块被分成四个新的更小的范围块，并且算法必须为它们迭代，被认为是编码过程的另一个步骤。该算法已被检查的一些著名的图像和结果进行了比较，与国家的最先进的算法。实验表明，我们提出的算法有相当少的编码时间比其他的编码图像的质量大致相同。
英文摘要：
In this paper a new fractal image compression algorithm is proposed in which the time of encoding process is considerably reduced. The algorithm exploits a domain pool reduction approach, along with using innovative predefined values for contrast scaling factor, S, instead of searching it across [0,1]. Only the domain blocks with entropy greater than a threshold are considered as domain pool. As a novel point, it is assumed that in each step of the encoding process, the domain block with small enough distance shall be found only for the range blocks with low activity (equivalently low entropy). This novel point is used to find reasonable estimations of S, and use them in the encoding process as predefined values, mentioned above, the remaining range blocks are split into four new smaller range blocks and the algorithm must be iterated for them, considered as the other step of encoding process. The algorithm has been examined for some of the well-known images and the results have been compared with the state-of-the-art algorithms. The experiments show that our proposed algorithm has considerably lower encoding time than the other where the encoded images are approximately the same in quality.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
