Fractal image compression: a randomized approach

Authors:
S. K. Ghosh;Jayanta Mukherjee;P. P. Das
Affiliations:
Computer and Informatics Centre, Indian Institute of Technology and Engineering, Kharagpur 721302, India;Department of Computer Science and Engineering, Indian institute of Technology, Kharagpur 721302, India;Interra Systems (India) Limited, Saltlake, Kolkata 700091, India
Venue:
Pattern Recognition Letters
Year:
2004

Citing 10
Cited 0

The JPEG still picture compression standard

Communications of the ACM - Special issue on digital multimedia systems
Fractal image compression: theory and application

Fractal image compression: theory and application
A review of the fractal image compression literature

ACM SIGGRAPH Computer Graphics
Fractal Imaging

Fractal Imaging
A pyramid algorithm for fast fractal image compression

ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Technique for fractal image compression using genetic algorithm

IEEE Transactions on Image Processing
A review of the fractal image coding literature

IEEE Transactions on Image Processing
Combining fractal image compression and vector quantization

IEEE Transactions on Image Processing
A graph-theoretic approach for studying the convergence of fractal encoding algorithm

IEEE Transactions on Image Processing
A fast encoding algorithm for fractal image compression using the DCT inner product

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.10

Visualization

Abstract

The fractal image compression is inherently time intensive and thus there is a growing need to increase its speedup. This paper presents a fast encoding scheme where the domain blocks are searched randomly for every range block. An analysis of the basic fractal image compression method has been carried out and on the basis of the analysis a method for image characterization has been proposed. Then a detailed theoretical analysis of this randomized fractal compression scheme has been presented and the results are validated with the experimental ones. The random approach has been found to be quite efficient giving considerable increase in speed-up compared to several other approaches.