Fractal image coding is a very promising compression technique

but it suffers from long encoding time.The time to encode fractally an image is mostly spent on searching for the best-matched block for each of range blocks in a usually-large domain pool.This paper thus proposed a fast fractal encoding algorithm based on fractional box-counting dimension of an image block

which can find out the best-matched block for an input range block with a reduced search.Experimental results show that the proposed algorithm can significantly shorten the encoding time

while achieving the same or better decoded image quality as baseline fractal algorithm with full search.