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

Most fractal coding schemes employ an iterative decoding algorithm in order to reconstruct the approximation of the original signal from the fractal code. A necessary condition for obtaining a unique solution is the convergence of the reconstruction process. This paper reports on investigations concerning a necessary and sufficient condition for convergence which is based upon the spectral radi...

9  Abstract— In this paper, we present a hybrid fractal image compression method for satellite images. The proposed algorithm uses entropy and arithmetic coding. The satellite image is decomposed into low frequency sub-band and high frequency sub-band. The low frequency sub-band uses fractal coding, thus making the low-frequency information loss less which is sensitive to human visual system. ...

Progressive coding techniques are becoming more and more important as they enable quick browsing of large image databases. Fractal image compression is not intrinsically suitable for hierarchical schemes, but the proposed algorithm yields interesting results thanks to a set of new features. The main novelties are the introduction of a residual coding approach, the use of a quadtree decompositio...

This paper presents estimations of multi-scale (multi-fractal) measures for feature extraction from deoxyribonucleic acid (DNA) sequences, and demonstrates the intriguing possibility of identifying biological functionality using information contained within the DNA sequence. We have developed a technique that seeks patterns or correlations in the DNA sequence at a higher level than the local ba...

The Discrete Fractal Transformation has recently emerged as a powerful technique for coding images. The scheme works by dividing an image into blocks and making use of a contraction mapping by which the domain blocks are mapped into range blocks. During this process it is usual to filter the domain blocks. In this work, we show how a change in the filtering procedure can improve the image quali...

Fractal image compression is a technique based on the representation of an image by a contractive transform, on the space of images, for which the fixed point is close to the original image. This broad principle encompasses a very wide variety of coding schemes, many of which have been explored in the rapidly growing body of published research. While certain theoretical aspects of this represen...

Over the past decade, there has been significant interest in fractal coding for the purpose of image compression. However, applications of fractal-based coding to other aspects of image processing have received little attention. We propose a fractal-based method to enhance and restore a noisy image. If the noisy image is simply fractally coded, a significant amount of the noise is suppressed. H...

An enhanced iteration free fractal algorithm is proposed in this research paper to design an efficient domain pool for image compression. The proposed methodology reduces the coding process time, intensive computation tasks and also the memory requirements. The redundancies in the domain pool are reduced by the Linde Buzo Gray (LBG) Algorithm. For each range block, vector features such as mean ...

In this paper, the basic theory of image fractal compression is briefly introduced; some typical fractal compression approaches are discussed. Based on this discussion, according to the problem of long encoding time which exists in the typical fractal compression approaches, we propose a fast image fractal compression approach based on the combination of adaptive quad tree compression approach ...