留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码
Volume 8 Issue 2
Jun.  2001
数据统计

分享

计量
  • 文章访问数:  274
  • HTML全文浏览量:  85
  • PDF下载量:  19
  • 被引次数: 0
Berthe Kya and Yang Yang, Optimization of Fractal Iterated Function System(IFS) with Probability and Fractal Image Generation, J. Univ. Sci. Technol. Beijing, 8(2001), No. 2, pp. 152-156.
Cite this article as:
Berthe Kya and Yang Yang, Optimization of Fractal Iterated Function System(IFS) with Probability and Fractal Image Generation, J. Univ. Sci. Technol. Beijing, 8(2001), No. 2, pp. 152-156.
引用本文 PDF XML SpringerLink
Information

Optimization of Fractal Iterated Function System(IFS) with Probability and Fractal Image Generation

  • There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency 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 with each set |S| to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.
  • Information

    Optimization of Fractal Iterated Function System(IFS) with Probability and Fractal Image Generation

    + Author Affiliations
    • There are several methods for rendering fractal images based on IFS (Iterated Function System) in computer graphic; but one concern of the computer graphic community has been the efficiency 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 with each set |S| to generate the attractor in least time possible is introduced, then a new method based on the self similarity and multi-fractal analysis is presented. The efficiency of the new method has been proved over the conventional method.
    • loading

    Catalog


    • /

      返回文章
      返回