Learn More
Fractal image compression is attractive except for its high encoding time requirements. The image is encoded as a set of contractive affine transformations. The image is partitioned into non-overlapping range blocks, and a best matching domain block larger than the range block is identified. There are many attempts on improving the encoding time by reducing(More)
The computational complexity of fractal image compression is mainly because of the huge number of comparisons required to find a matching domain block corresponding to the range blocks within the image. Various schemes have been presented by researchers for domain classification which can lead to significant reduction in the time spent for range-domain(More)
  • 1