首页> 外文期刊>IEICE Transactions on Information and Systems >Escape-Time Modified Algorithm for Generating Fractal Images Based on Petri Net Reachability
【24h】

Escape-Time Modified Algorithm for Generating Fractal Images Based on Petri Net Reachability

机译:基于Petri网可达性的逃逸时间修正分形图像生成算法

获取原文
获取原文并翻译 | 示例
           

摘要

This paper presents a new approach to com- puter image generation via three proposed methods for translat- ing the evolution of a Petri net into fractal image synthesis. The idea is derived from the concept of fractal iteration principles in the escape-time algorithm and chaos game. The approach uses a Petri net as a powerful abstract modeling tool for fractal image synthesis via its duality, deadlock, inhibitor arc, firing sequence and marking reachability. The objective of this approach is to enhance the analysis technique of a Petri net and use it as a novel technique for fractal image synthesis. Generating fractal images via the dynamics of a Petri net allows an easy and direct proof for the similarity and correspondence between the dynam- ics of complex quadratic fractals by the recursive procedure of the escape-time algorithm and the state of a Petri net via a reacha- bility problem. The reachability problem will be manipulated in terms of the dynamics of the fractal in order to generate images via three proposed methods. Validation of our approach is given by discussion and an illustration of some experimental results.
机译:本文提出了一种通过三种提出的将Petri网的演化转化为分形图像合成的方法来生成计算机图像的新方法。该思想源自逃生时间算法和混沌游戏中的分形迭代原理的概念。该方法通过将Petri网的对偶性,死锁,抑制弧,触发序列和标记可达性用作对分形图像合成的强大抽象建模工具。该方法的目的是增强Petri网的分析技术,并将其用作分形图像合成的新技术。通过Petri网的动力学生成分形图像,可以轻松,直接地证明逃逸时间算法的递归过程和复杂二次分形的动力学之间的相似性和对应性,以及通过可达点的Petri网状态。 -能力问题。将通过分形的动力学来处理可达性问题,以便通过三种建议的方法生成图像。通过讨论和一些实验结果的说明对我们的方法进行了验证。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号