An eliminated fractal compression algorithm by variance

A new fast fractal encoding algorithm for the processes of searching and matching is proposed in fractal image compression in this paper. The number of domain blocks searched to find the best match for each range block and corresponding encoding time are much reduced by elimination domain blocks not searching using the current minimum distortion and variance difference between the range block and domain block. The algorithm produces a completely identical fractal encoding to that of the conventional full search in reduced time.