论文部分内容阅读
针对分形编码算法编码时间太长、精度控制需要细分等缺点提出对编码图像进行分级逼近的新的分形编码算法．对这一思想的可行性在理论上进行了有益的探索，给出了该算法成立的理论基础，并得出了任给一图像，都可以找出一组压缩变换，使得从任意图像出发，经该组变换压缩迭代后重构原始图像的新的构造性证明．给出一个新的具体实现分形编码的算法．实验表明，在提高压缩比和图像恢复质量的同时，运算时间也大大缩短
Aiming at the shortcomings of the coding time of the fractal coding algorithm being too long and the precision control needing to be subdivided, a new fractal coding algorithm for the hierarchical approximation of the coded image is proposed. The feasibility of this idea is explored in theory. The theoretical basis for the establishment of this algorithm is given. It is concluded that any given image can find a set of compression transformations so that starting from any image, A new constructive proof of reconstructing the original image after this group of transformed and compressed iterations. A new algorithm of fractal coding is given. Experiments show that, while improving the compression ratio and image quality, the computation time is also greatly reduced