Subscribe

Issue No.04 - July (1996 vol.16)

pp: 25-33

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.511849

ABSTRACT

When every domain element can be expressed as the union of range elements, fractal image compression produces a structure equivalent to a recurrent iterated function system. This equivalence broadens the scope of the recurrent iterated function system, enabling it to represent arbitrary shapes. The RIFS representation encodes bitmaps better than standard fractal image compression, and supports further processing such as edge detection and escape time visualization.

INDEX TERMS

Bitmap, fractal image compression, inverse problem, recurrent iterated function system.

CITATION

John C. Hart, "Fractal Image Compression and Recurrent Iterated Function Systems",

*IEEE Computer Graphics and Applications*, vol.16, no. 4, pp. 25-33, July 1996, doi:10.1109/38.511849REFERENCES