Because of the great data of the hyperspectral image, it is not good for storage and transmission. To work out a high efficiency compression method for hyperspectral image is essential. Prediction encoding is easy to realize and has been studied widely in the hyperspectral image compression field. High compression ratio, resolution independence and fast decoding speed are the main advantages of...

In this paper, we propose a very low bit-rate video compression algorithm that is based on fractal coding in the wavelet domain. Fractal compression techniques utilise local selfsimilarities present in images, to form images of properly transformed parts of itself. The recent discovery of the link between fractal compression and wavelets, have improved the performance of fractal coders. The sel...

A new hybrid wavelet-fractal coder (WFC) for image compression is proposed in this research. We show that the application of contractive mapping for interscale wavelet prediction in the wavelet domain o ers bit rate savings in some regions. The prediction residue is then quantized and encoded by traditional wavelet coders. WFC allows the exibility to choose either direct coding of wavelet coe c...

We describe two dimensional DNA walks, and analyze their fractal properties. We show results for the complete genome of S. cerevisiae. We find that the mean square deviation of the walks is superdifussive, corresponding to a fractal structure of dimension lower than two. Furthermore, the coding part of the genome seems to have smaller fractal dimension, and longer correlations, than noncoding p...

This research paper on iteration free fractal image compression for color images using the techniques Vector Quantization, Genetic Algorithm and Simulated Annealing is proposed, for lossy compression, to improve the decoded image quality, compression ratio and reduction in coding time. Fractal coding consists of the representation of image blocks through the contractive transformation coefficie...

We show how fractal image coding can be viewed and generalized in terms of the method of projections onto convex sets (POCS). In this approach, the fractal code defines a set of spatial domain similarity constraints. We also show how such a reformulation in terms of POCS allows additional contraints to be imposed during fractal image decoding. Two applications are presented: image construction ...

Based on the standard fractal transformation in the spatial domain, simple relations may be found relating coefficients in detail(high-pass) subbands in the wavelet domain. In this paper, we devise a hybrid image compression using fractal-wavelet prediction where the causal similarity among blocks of different subbands in a wavelet decomposition of the image is exploited. The proposed coding sc...

Why does fractal image compression work? What is the implicit image model underlying fractal block coding? How can we characterize the types of images for which fractal block coders will work well? These are the central issues we address. We introduce a new wavelet-based framework for analyzing block-based fractal compression schemes. Within this framework we are able to draw upon insights from...

Indexing terms: Coding, Image processing, Fractal transforms In this letter the contractivity of existing fractal transforms for use in image compression schemes is examined. The coding process is described as nonlinear transformation in the finite dimensional euclidean vector space. We derive sufficient conditions for contractivity based on the spectral norm and the spectral radius of the tran...