Fractal image compression entails a computationally costly search for
matching image blocks. It is proposed that a block be represented by i
ts DCT coefficients, which may be made invariant to many of the usual
block transforms. Owing to the energy packing properties of the DCT, t
he efficiency of an existing multidimensional nearest neighbour search
is improved.