Fast Fractal Coding Algorithm Based on Twice Pre-searching

A fast fractal coding algorithm is proposed in this paper. This algorithm is based on Jacquin's full search algorithm. When matching range-domain blocks, by utilizing the variance of the image block and the relativity between the image blocks, this algorithm performs twice pre-searching, thus avoiding vast matching computation and reducing the coding time greatly. Experimental results show that the coding time can be reduced approximately by 80% while the PSNR of the most reconstructed images is increased by this algorithm.