Possibilities for fast Generation of Fractal Images and Various Fields of Applicability

Bogdan Popa, C. Ionete, A. Lorincz, Laviniu Aurelian Badulescu
{"title":"Possibilities for fast Generation of Fractal Images and Various Fields of Applicability","authors":"Bogdan Popa, C. Ionete, A. Lorincz, Laviniu Aurelian Badulescu","doi":"10.1109/iccc54292.2022.9805946","DOIUrl":null,"url":null,"abstract":"The results of this paper consist of testing and performing comparisons for some fractals set generation applications, such as Mandelbrot sets. The fractal generation part represents an area of analysis and illustration of the modalities of parallel calculation. This method implies a very high degree of accuracy, respecting the selected fractal generation mathematical model, and does not represent a specialized method for a certain type of image. This fractal study is exemplified by the Mandelbrot set because it represents a method that reveals its usefulness in various applications in different fields. During the study, was discovered different types of images that can hardly be obtained by other methods and can be compared, in terms of complexity, only with some natural ones, extremely beautiful. The complexity and infinity of these images create a new field of research for the future.This paper aims to present an interesting way to design sets of fractals, considering different methods, starting from the contribution of parallel programming in contrast to sequential programming, to highlight the modern methods of accelerating the computation time. Starting from the generation of fractal images, they are used in several other image compression applications, to analyze the results of some natural resources with examples in the paper.","PeriodicalId":167963,"journal":{"name":"2022 23rd International Carpathian Control Conference (ICCC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 23rd International Carpathian Control Conference (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc54292.2022.9805946","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The results of this paper consist of testing and performing comparisons for some fractals set generation applications, such as Mandelbrot sets. The fractal generation part represents an area of analysis and illustration of the modalities of parallel calculation. This method implies a very high degree of accuracy, respecting the selected fractal generation mathematical model, and does not represent a specialized method for a certain type of image. This fractal study is exemplified by the Mandelbrot set because it represents a method that reveals its usefulness in various applications in different fields. During the study, was discovered different types of images that can hardly be obtained by other methods and can be compared, in terms of complexity, only with some natural ones, extremely beautiful. The complexity and infinity of these images create a new field of research for the future.This paper aims to present an interesting way to design sets of fractals, considering different methods, starting from the contribution of parallel programming in contrast to sequential programming, to highlight the modern methods of accelerating the computation time. Starting from the generation of fractal images, they are used in several other image compression applications, to analyze the results of some natural resources with examples in the paper.
快速生成分形图像的可能性和各种应用领域
本文的结果包括对一些分形集生成应用程序(如Mandelbrot集)的测试和执行比较。分形生成部分代表了一个分析和说明并行计算模式的领域。该方法具有很高的精度,尊重所选择的分形生成数学模型,并不代表特定类型图像的专门方法。这种分形研究以Mandelbrot集合为例,因为它代表了一种方法,揭示了它在不同领域的各种应用中的实用性。在研究过程中,发现了不同类型的图像,这些图像很难通过其他方法获得,在复杂性方面,只能与一些自然图像进行比较,非常漂亮。这些图像的复杂性和无限性为未来创造了一个新的研究领域。本文旨在提出一种有趣的方法来设计分形集,考虑不同的方法,从并行编程的贡献与顺序编程的对比开始,以突出加速计算时间的现代方法。本文从分形图像的生成入手,将其应用于其他几种图像压缩应用中,并结合实例对一些自然资源的压缩结果进行了分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信