Fractals everywhere
The algorithmic beauty of plants
The algorithmic beauty of plants
Fractal image compression
Escape-time visualization method for language-restricted iterated function systems
Proceedings of the conference on Graphics interface '92
The object instancing paradigm for linear fractal modeling
Proceedings of the conference on Graphics interface '92
Fractal image compression: theory and application
Fractal image compression: theory and application
A review of the fractal image compression literature
ACM SIGGRAPH Computer Graphics
Chaos and Fractals
Efficiently Computable Fitness Functions for Binary Image Evolution
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Identification and simulation of a spatial ecological model in a lake with fractal boundary
Mathematics and Computers in Simulation
Practical evaluation of efficient fitness functions for binary images
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Generation of IFS fractal images based on hidden markov model
Transactions on Edutainment VIII
Fractal self-similarity measurements based clustering technique for SOAP Web messages
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
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.