In fractal image compression an image is partitioned into a set of image blocks, called ranges. The ranges are matched with blocks taken from a codebook of l-tered and subsampled domain image blocks up to an aane transformation of intensity values. It is common practise in fractal image compression to include all 8 isometric versions of a codebook block in the codebook. It is reasoned that such...

This paper presents an approach for fractal image compression that yields the best performance compared to fractal methods that do not rely on hybrid transform coding. The achievement is obtained using the standard algorithm in which the image is partitioned into non-overlapping range blocks which are approximated by corresponding larger domain blocks with image intensities that are affinely si...

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...

Compression of the color images and videos has many applications in most of the mobile technologies. Reducing the time taken for file transfer is important in digital communication fields. Image compression means reducing the graphics file size, without degrading the quality of the image. For digital images, Fractal image Compression (FIC) and run length coding has been considered as an efficie...

This paper presents a method for fast encoding and decoding of image sequences based on fractal coding theory and the hybrid coding concept. The DPCM-loop accounts for statistical dependencies of natural image sequences in temporal direction. Those regions of the original image where the prediction, i.e. motion estimation and compensatio, fails are encoded using an advanced fractal coding schem...

Entropy of an image can be taken as a parameter of variation among pixel values. Equal value for all pixels in an image results in zero entropy. This idea is incorporated at the time of partitioning the image. Partitions are done with zero entropy in order to make the compression lossless. Unlike traditional fractal image compression mechanism this method doesn’t require two separate partitions...

Since fractal image compression is computationally very expensive , speedup techniques are required in addition to parallel processing in order to compress large images in reasonable time. In this paper we introduce a new parallelization approach for fractal image compression algorithms which employ block classiication as speedup method suited for multicomputers.

Terrain morphology has been on the radar of Computer Graphics for more than twenty years and various techniques for its modeling have been presented. These approaches range from fractal and multifractal surface generation to physically-based models of erosion and weathering. From all the weathering phenomena that can be observed in Nature, the hydraulic erosion has the major visual importance. ...

This work proposes a novel technique for the extraction of descriptors of a texture image. The method consists in modeling the image through a complex network, based on the distribution of gray-level intensities. Therefore, we process the adjacency matrix as a geometrical object and compute its fractal dimension. Thus we apply a multiscale transform over the powerlaw fractal curve, obtaining th...

Fractal image compression is a new technique for encoding images compactly. It builds on local self-similarities within images. Image blocks are seen as rescaled and intensity transformed approximate copies of blocks found elsewhere in the image. This yields a self-referential description of image data, which | when decoded | shows a typical fractal structure. This paper provides an elementary ...