scholarly journals REVERSE ITERATED FUNCTION SYSTEM AND DIMENSION OF DISCRETE FRACTALS

2009 ◽  
Vol 79 (1) ◽  
pp. 37-47 ◽  
Author(s):  
QI-RONG DENG
Keyword(s):  
Iterated Function System ◽  
Invariant Set ◽  
Function System ◽  
Computation Method ◽  
Iterated Function ◽  
Expansive Maps

AbstractA reverse iterated function system is defined as a family of expansive maps {T1,T2,…,Tm} on a uniformly discrete set $M\subset \Bbb {R}^d$. An invariant set is defined to be a nonempty set $F\subseteq M$ satisfying F=⋃ j=1mTj(F). A computation method for the dimension of the invariant set is given and some questions asked by Strichartz are answered.

Fractals in the Large

1998 ◽  
Vol 50 (3) ◽  
pp. 638-657 ◽  
Author(s):  
Robert S. Strichartz
Keyword(s):  
Invariant Measure ◽  
Power Series ◽  
Metric Space ◽  
Iterated Function System ◽  
Invariant Set ◽  
Invariant Sets ◽  
Iterated Function ◽  
Positive Weights ◽  
Self Similar ◽  
Expansive Maps

AbstractA reverse iterated function system (r.i.f.s.) is defined to be a set of expansive maps ﹛T1,…, Tm﹜ on a discrete metric space M. An invariant set F is defined to be a set satisfying , and an invariant measure μ is defined to be a solution of for positive weights pj. The structure and basic properties of such invariant sets and measures is described, and some examples are given. A blowup ℱ of a self-similar set F in ℝn is defined to be the union of an increasing sequence of sets, each similar to F. We give a general construction of blowups, and show that under certain hypotheses a blowup is the sum set of F with an invariant set for a r.i.f.s. Some examples of blowups of familiar fractals are described. If μ is an invariant measure on ℤ+ for a linear r.i.f.s., we describe the behavior of its analytic transform, the power series on the unit disc.

ARCLENGTH AS THE INVARIANT MEASURE FOR AN IFS WITH PROBABILITIES

Fractals ◽  
2015 ◽  
Vol 23 (04) ◽  
pp. 1550046
Author(s):  
D. LA TORRE ◽  
F. MENDIVIL
Keyword(s):  
Invariant Measure ◽  
Iterated Function System ◽  
Function System ◽  
Iterated Function

Given a continuous rectifiable function [Formula: see text], we present a simple Iterated Function System (IFS) with probabilities whose invariant measure is the normalized arclength measure on the graph of [Formula: see text].

Stochastic Fractal Modeling and Process Planning for Machining Using Two-Dimensional Iterated Function System

2008 ◽  
Vol 392-394 ◽  
pp. 575-579
Author(s):  
Yu Hao Li ◽  
Jing Chun Feng ◽  
Y. Li ◽  
Yu Han Wang
Keyword(s):  
Path Planning ◽  
Tool Path ◽  
Iterated Function System ◽  
Numerical Control ◽  
Function System ◽  
Tool Path Planning ◽  
Ongoing Research ◽  
Iterated Function ◽  
Planning Algorithm ◽  
Path Planning Algorithm

Self-affine and stochastic affine transforms of R2 Iterated Function System (IFS) are investigated in this paper for manufacturing non-continuous objects in nature that exhibit fractal nature. A method for modeling and fabricating fractal bio-shapes using machining is presented. Tool path planning algorithm for numerical control machining is presented for the geometries generated by our fractal generation function. The tool path planning algorithm is implemented on a CNC machine, through executing limited number of iteration. This paper describes part of our ongoing research that attempts to break through the limitation of current CAD/CAM and CNC systems that are oriented to Euclidean geometry objects.

Fractal dimension and iterated function system (IFS) for speech recognition

1992 ◽  
Vol 28 (15) ◽  
pp. 1382 ◽  
Author(s):  
E.L.J. Bohez ◽  
T.R. Senevirathne ◽  
J.A. van Winden
Keyword(s):  
Fractal Dimension ◽  
Speech Recognition ◽  
Iterated Function System ◽  
Function System ◽  
Iterated Function

Fractal Top for Contractive and Non-Contractive Transformations

2012 ◽  
Vol 3 (4) ◽  
pp. 49-65
Author(s):  
Sarika Jain ◽  
S. L. Singh ◽  
S. N. Mishra
Keyword(s):  
Fixed Point ◽  
Iterated Function System ◽  
Function System ◽  
Feedback Process ◽  
Iterated Function ◽  
Spatial Part ◽  
One Step ◽  
The One ◽  
Definition Of

Barnsley (2006) introduced the notion of a fractal top, which is an addressing function for the set attractor of an Iterated Function System (IFS). A fractal top is analogous to a set attractor as it is the fixed point of a contractive transformation. However, the definition of IFS is extended so that it works on the colour component as well as the spatial part of a picture. They can be used to colour-render pictures produced by fractal top and stealing colours from a natural picture. Barnsley has used the one-step feed- back process to compute the fractal top. In this paper, the authors introduce a two-step feedback process to compute fractal top for contractive and non-contractive transformations.

Sign in / Sign up

Export Citation Format

Share Document