Iterated function systems have been recently applied to the field of image coding. This paper exploits the fractal properties included in the coding and decoding schemes, in order to add useful tools for image processing. The first contribution consists of an improvement of the classical fractal zoom which allows, with a unique code, to increase the image resolution without loss in sharpness. T...

The redundancy of the multiresolution representation has been clearly demonstrated in the case of fractal images, but it has not been fully recognized and exploited for general images. Fractal block coders have exploited the self-similarity among blocks in images. We devise an image coder in which the causal similarity among blocks of different subbands in a multiresolution decomposition of the...

This paper presents the hardware architecture for fractal image compression (FIC) with quadtree partitioning. Fractal image coding with quadtree partitioning allows one to produce higher quality of image. Processing image areas of different complexity with image blocks of varying size enables proper exploration of image details. Additionally, exploiting parallelism present within the algorithm ...

This paper proposes a parallel architecture for quadtreebased fractal image coding. This architecture is capable of performing the fractal image coding based on quadtree partitioning without the external memory for the fixed domain pool. Since a large domain block consists of small domain blocks, the calculations of distortion for all kinds of domain blocks are performed by the summation of the...

Fractal codification of images is based on self-similar and self-affine sets. The codification process consists of construction of an operator which will represent the image to be encoded. If a complicated picture can be represented by an operator then it will be transmitted or stored very efficiently. Clearly, this has many applications on data compression. The great disadvantage of the automa...

We propose a joint source channel coding system for fractal image codes in which both a transmission bit rate allocation scheme and an unequal error protection strategy are considered. We express the total distortion in terms of the source distortion and the channel distortion. Then, we allocate the available total bit rate between the source code and a range of error-correcting codes using a L...

Fractal-based image coders suuer from perceptually annoying distortion in textured areas. This paper discusses possible reasons for this limitation. A texture may be modelled as a stochastic process with place-independent autocorrelation properties. Two image areas should have similar correlation (spectral) properties to be perceived as belonging to the same texture. We show that stationary tex...

One of the efficient solutions for data transmission and storage of huge remote sensing images is the high-fidelity and rapid compression. The hybrid algorithms based on fractal coding and wavelet transformation have already been developed and are becoming very popular at present. In this paper, an improved method of remote sensing image compression based on fractal coding and wavelet domain is...

Fractal image coding has the advantage of higher compression ratio, but is a lossy compression scheme. The encoding procedure consists of dividing the image into range blocks and domain blocks and then it takes a range block and matches it with the domain block. The image is encoded by partitioning the domain block and using Affine transformation to achieve fractal compression. The image is rec...

Diffusion of the attractor or reconstructed image of the fractal code provides us a technique to restore edge information. Because of coding error associated with the fractal mappings, edges are degraded at high compression ratios. Partitioning compensates for the degradation, but lowers the compression ratios significantly and does not insure the retention of significant edges. The diffusion t...