Optimization of Fractal Iterated Function System(IFS)with Probability and Fractal Image Generation
Optimization of Fractal Iterated Function System(IFS)with Probability and Fractal Image Generation
复制标题
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Berthé;Kya
中科院分区：
文献类型：
--
作者：
Berthé;Kya
基于IFS的分形图像绘制方法有多种计算机图形学中的迭代函数系统但计算机图形学界一直关注的问题之一是绘制算法的效率。利用概率算法的迭代函数系统（Iterate Function System with Probability）也被称为混沌博弈。本文介绍了传统的选择与每个集合[S]相关联的概率来产生吸引子的方法，然后提出了一种基于自相似性和多重分形分析的新方法，并证明了新方法比传统方法更有效。
There are several methods for rendering fractal images based on IFS(Iterated Function System) in computer graphic;but one concern on the computer graphic community has been the efficience rendering algorithms.The invariant measures arising from IFSP(Iterate Function System with Probability)using the probabilistic algorithm are also known as chaos games.The role of these probabilities to generate the image of the attractor has been investigated using a multi-fractal analysis.The conventional choice of probability associated whth each set[S]to generate the attractor in least thme introduced,then a new medhod bsed on the self similarity and multi-fractal analysis is presented.The efficiency of the new method has been proved over the conventional method.