D. M. Monro, S. J. Woolley. Fractal image compression without searching. In Proceedings of ICASSP-1994 IEEE International Conference on Acoustics, Speech and Signal Processing, Volume 5, Adelaide, 1994.
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 gegree 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 quantization of the fractal coefficients through differential coding. The other coefficients are quantized directly, and Huffmann coding of each gives a compressed image. Possibilities for further compression are discussed.
@InProceedings{MoWo94a,
Author = {Monro, D. M. and Woolley, S. J.},
Title = {Fractal image compression without searching},
BookTitle = {Proceedings of ICASSP-1994 IEEE International Conference on Acoustics, Speech and Signal Processing},
Volume = {5},
Address = {Adelaide},
Year = {1994}
}