Speeding up fractal image compression using selective points method (SPM)‎

Abstract EN

Fractal image compression is a comparatively new technique.

The most significant claimed advantages are high reconstruction quality at low encoding rates, rapid decoding in the sense that an encoded image may be decoded at a higher resolution than the original.

In our work, we have discussed the hierarchical quadtree scheme.

The image region is partitioned into variable block size using quadtree data structure.

Partitioning process was performed as a first stage in the encoding scheme.

The uniformity criterion based on the distortion level of the pixels gray value was utilized to decide w hether the range block should be partitioned or not.

In order to reduce the encoding time more efficiently the novel method were suggested and implemented to perform the full-search affine matching, This method based on taking some selective pixels of the range block to do the domain- range matching.

The obtained results indicate that the suggested novel scheme significantly improves the encoding time costs with increasing the distortion level.