Fast image domain fractal compression by DCTdomain block matching

Abstract

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