Fractal image compression: a randomized approach

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

Full description

Saved in:

Bibliographic Details
Published in:	Pattern recognition letters Vol. 25; no. 9; pp. 1013 - 1024
Main Authors:	Ghosh, S.K., Mukherjee, Jayanta, Das, P.P.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 02-07-2004
Subjects:	Fractal image compression (FIC) Image compression Iterated function system (IFS) Iterated function system (IFS) Fractal image compression (FIC) Image compression
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	0167-8655 1872-7344
DOI:	10.1016/j.patrec.2004.02.008