Quad-tree partitioned fractal coding based on region competition strategy
Yonghong Chen, Zelin Shi · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2007
To deal with the time-consuming problem in the fractal coding, a novel method based on the region competition strategy is introduced to improve the speed of fractal coding effectively. This strategy adopted can discover the optimal affine matching block and the optimal affine transformation of each range block, improving some affine ones with bigger error. Experiments on still life image, fractal image and remote sensing image show that the proposed scheme reduces the compression time and obtains the approximate reconstruction fidelity while it has the same compression ratios as that of adaptive quad-tree partitioned fractal coding.