Fractal image compression without searching

We study the fidelity/compression performance of fast fractal image coding. The Bath fractal transform (BFT) is a generalization of earlier methods with a range of implementation options for the order of approximation and degree of searching. All fractal transforms are fast to decode, and the zero searching variants are nearly as fast to code. We examine BFTs of zero order (flat), first order (bilinear) and second order (biquadratic). The degradation introduced by Lloyd-Max (1982) quantization of the fractal coefficients is evaluated. Further compression is achieved by exploiting correlation in one of the fractal coefficients through differential coding. The other coefficients are quantized directly, and Huffman coding of each gives a compressed image. Possibilities for further compression are discussed