Intrinsic parallel random iteration algorithm for fractal image decoding based on iterated function system code

2005 ◽  
Vol 44 (3) ◽  
pp. 037002
Author(s):  
Chung J. Kuo
Keyword(s):  
Iterated Function System ◽  
Function System ◽  
Iteration Algorithm ◽  
Fractal Image ◽  
Iterated Function ◽  
Random Iteration ◽  
Image Decoding

A PROBABILISTIC POWER DOMAIN ALGORITHM FOR FRACTAL IMAGE DECODING

2002 ◽  
Vol 02 (02) ◽  
pp. 161-173
Author(s):  
V. DRAKOPOULOS ◽  
A. KAKOS ◽  
N. NIKOLAOU
Keyword(s):  
Complexity Analysis ◽  
Iterated Function System ◽  
Function System ◽  
Fractal Image ◽  
Power Domain ◽  
Iterated Function ◽  
Image Decoding

A new algorithm, called herein the random power domain algorithm, is discussed; it generates the image corresponding to an iterated function system with probabilities, a technique used in fractal image decoding. A simple complexity analysis for the algorithm is also derived.

scholarly journals GPU-Accelerated Rendering of Unbounded Nonlinear Iterated Function System Fixed Points

2012 ◽  
Vol 2012 ◽  
pp. 1-17
Author(s):  
Orion Sky Lawlor
Keyword(s):  
Fixed Points ◽  
Iterated Function System ◽  
Nonlinear Function ◽  
Texture Mapping ◽  
Iterated Function Systems ◽  
Function System ◽  
Graphics Hardware ◽  
Iteration Algorithm ◽  
High Definition ◽  
Iterated Function

Nonlinear functions, including nonlinear iterated function systems, have interesting fixed points. We present a non-Lipschitz theoretical approach to nonlinear function system fixed points which generalizes to noncontractive functions, compare several methods for evaluating such fixed points on modern graphics hardware, and present a nonlinear generalization of Barnsley’s Deterministic Iteration Algorithm. Unlike the many existing randomized rendering algorithms, this deterministic method avoids noncoherent branching and memory access and takes advantage of programmable texture mapping hardware. Together with the performance potential of modern graphics hardware, this allows us to animate high-quality and high-definition fixed points in real time.

scholarly journals A FRACTAL VALUED RANDOM ITERATION ALGORITHM AND FRACTAL HIERARCHY

Fractals ◽  
2005 ◽  
Vol 13 (02) ◽  
pp. 111-146 ◽  
Author(s):  
MICHAEL BARNSLEY ◽  
JOHN HUTCHINSON ◽  
ÖRJAN STENFLO
Keyword(s):  
Iterated Function System ◽  
Iteration Algorithm ◽  
Affine Transformations ◽  
Random Fractals ◽  
Underlying Space ◽  
System A ◽  
Special Cases ◽  
Iterated Function ◽  
Random Iteration ◽  
Potential Applications

We describe new families of random fractals, referred to as "V-variable", which are intermediate between the notions of deterministic and of standard random fractals. The parameter V describes the degree of "variability": at each magnification level any V-variable fractals has at most V key "forms" or "shapes". V-variable random fractals have the surprising property that they can be computed using a forward process. More precisely, a version of the usual Random Iteration Algorithm, operating on sets (or measures) rather than points, can be used to sample each family. To present this theory, we review relevant results on fractals (and fractal measures), both deterministic and random. Then our new results are obtained by constructing an iterated function system (a super IFS) from a collection of standard IFSs together with a corresponding set of probabilities. The attractor of the super IFS is called a superfractal; it is a collection of V-variable random fractals (sets or measures) together with an associated probability distribution on this collection. When the underlying space is for example ℝ2, and the transformations are computationally straightforward (such as affine transformations), the superfractal can be sampled by means of the algorithm, which is highly efficient in terms of memory usage. The algorithm is illustrated by some computed examples. Some variants, special cases, generalizations of the framework, and potential applications are mentioned.

scholarly journals PERANCANGAN PERANGKAT LUNAK GENERATOR GAMBAR DAN MUSIK FRAKTAL DENGAN METODE ITERATED FUNCTION SYSTEM

2007 ◽  
Vol 1 (2) ◽  
pp. 140
Author(s):  
Tri Djoko Wahjono ◽  
Syaeful Karim ◽  
Bayu Riyadi
Keyword(s):  
Research Method ◽  
Iterated Function System ◽  
Function System ◽  
Clear Image ◽  
Fractal Image ◽  
Iterated Function ◽  
Art Research

Article presents analysis and analyze a software that utilize Geometry Fractal, especially Iterated FunctionSystem Fractal, as art. Research method that has been used in this research is by library study and by laboratoriumstudy to test the performance of the software. Result of the research has shown that converted music by GeometryFractal has various results, which depend on the parameters used in it and type of Geometry Fractal image produced.It can be said that usage of fractal in high iteration can produce clear image fractal and complicated music fractal.

Sign in / Sign up

Export Citation Format

Share Document