In order to improve quality of fractal image coding and reduce coding time

a fast polynomial fractal image coding method based on wavelet decomposition is presented in this papre. Jacquin's fractal image coding method needs searchign for the optimum domain block in the image. It must take so long time to do this searching work. This character is a fatal flaw of the method which confine this method in using. Monro's fractal image coding method doesn't meed searching for the optimum domain block

so his fractal image coding is very rapid and simple in reference. His coding method is zero searching fractal coding method and its coding time is very short. But his reconstructed image has blocking effect. In this paper. in order to solve this question

a new fractal image coding based on discrete wavelet transformation is presented. The new method also doesn't need searching for the optimum domain block

so its coding time is very short. This algorithm utilizes the character of wavelet analysis which is unbalanced distributions of energy in subbands among wavelet trasform image. The algorithm based on discrete wavelet transformation is:First

the image is decomposed into different channels by discrete wavelet transformation. Second

wavelet coefficients are encoded by fractal image coding method. Simulation shows that the quality of the reconstructed image is improved greatly and coding time is only 1.48 seconds.