Fast and Innovative Suitable Domain Search for Fractal Image Compression

Fractal Image compression is a very advantageous technique in the field of image compression. It shows the merits like very high compression ratio, high decompression speed, high bit rate and resolution independence. This technique is based on existence of self-symmetry in image. The coding phase of this technique is very time consuming because of computational expenses of suitable domain search. Despite the advances made, the huge encoding time remains the main holdup of this technique. In this paper we have proposed an approximation error based speed-up technique with the use of feature extraction and investigate the effect of efficient data structure on its performance. Proposed scheme reduces the number of range-domain comparisons with significant amount and gives improved time performance.