Speeding up fractal image compression

Various compression methods have been proposed. In recent year fractal image compression gained more interest because of their capability to achieve high compression ratios while maintaining very good quality of the reconstructed image. However, this method suffers from a long encoding time arise from very large number of domain blocks that must be examined to match each range block.  Our proposed technique based on Most Frequent Pixel (MFP) used to reduce the encoding time in fractal coding algorithms. In this technique, a limited number of frequently pixels ranging from (5 to10) have been adopted for a block of different sizes. The quality of the decoded image is affected by the number of pixels of gray values. When five pixels are limited, the decoded image is rather bad .Thus, when the limited numbers increase, the decoded image becomes clear more and more.  In this paper we found we can reduce the encoding time to half when applying MFP technique than the traditional technique and the reconstructed image need 6 iterations to reach it attractor.