A Fast Fractal Image Coding Algorithm Based on FGSE
In fractal image coding, the main consuming time is the process of finding the best matched domain block in a large domain pool for a given range block. In this paper, we propose a fast algorithm for fractal image coding based on the following lemma and fine granularity successive elimination (FGSE). The lemma describes the relationship between fractal image coding and FGSE. This algorithm can decrease about half domain pool before range-domain matching computation and further improve the speed by combining with other fast algorithms of fractal image coding. Simulation results show that our algorithm takes less coding time, has absolutely the same fidelity measured by PSNR as that of Saupe's and achieves super quality compared with Fisher's algorithm