Ohrimenko+ / Barnsley. Superfractals
.pdf
4.8 Deterministic calculation of attractors |
331 |
algorithms is determined by the contractivity factor of the IFS, as described in the following theorem.
T h e o r e m 4.8.1 (i) Let (X, d) be a complete metric space and let F be a hyperbolic IFS with probabilities, contractivity factor l and average contrac-
tivity factor l¯. Let A denote the set attractor of F. Let |
A0 H(X) and define |
recursively |
|
Ak = F( Ak−1), |
|
for k = 1, 2, . . . respectively; then |
|
klim Ak = A. |
(4.8.1) |
→∞ |
|
The rate of convergence is geometrical, according to |
|
d( Ak , A) ≤ lk · d( A0, A) for all k N.
(ii) Let (X, d) be a complete metric space and let F be a hyperbolic IFS with contractivity factor l. Let μ denote the measure attractor of F. Let μ0 P(X) and define recursively
μk = F(μk−1),
for k = 1, 2, . . . respectively; then
lim μk = μ.
k→∞
The rate of convergence is geometrical with respect to both the uniform Prokhorov metric dP and the Monge–Kantorovitch metric dP on P(X). Specifically,
dP ( Ak , A) ≤ lk · dP ( A0, A) and dP ( Ak , A) ≤ lk · dP ( A0, A) for k = 1, 2, . . .
P r o o f This is a straightforward consequence of the way in which contraction mappings work in complete metric spaces. See for example [9], [44] or [48].
Deterministic calculation of set attractors
In practical applications of Theorem 4.8.1 to two-dimensional computer graphics, the transformations and the spaces upon which they act must be discretized. The precise behaviour of computed sequences of approximations Ak+1, starting with A0 H(X), is defined by
Ak+1 = F( Ak ) = f1( Ak ) f2( Ak ) · · · f1( Ak ) for k = 0, 1, 2, . . .
It depends on the details of the implementation and is generally quite complicated; for example, the discrete IFS may have multiple attractors; see [79], Chapter 4.
332 |
Hyperbolic IFSs, attractors and fractal tops |
Figure 4.9 Illustration of the action of a deterministic algorithm for calculating a sequence of approximants for the attractor of an IFS. Shown, from left to right and top to bottom, are some of the sets F◦n (leaf ) for n = 0, 1, 2, . . . The last panel shows the attractor of the IFS, rendered using IFS colouring. The IFS is the one given in Table 4.5.
An example of a deterministic sequence of approximations is shown in Figure 2.21. Another example is shown in Figure 4.9.
Now notice this. Define
∞
Hk ( A0) := F◦k ( A0).
r =k
Then {Hk (B)}∞k=0 is a decreasing sequence of compact sets and so converges to a compact set. This limit is invariant under F and so must be the attractor A. This provides the basis for other deterministic algorithms for computing approximations
4.8 Deterministic calculation of attractors |
333 |
Figure 4.10 Read this picture from left to right and from top to bottom. The first panel shows the set, a leaf, and the second panel shows the union of the elements of its orbit under an IFS semigroup. The (k + 1)th panel shows the set n≥k F◦n (leaf ), that is, the union of the elements in the ‘tail’ of the set orbit. See also Figure 4.9, which uses the same IFS.
to the attractor, as illustrated for example in Figure 4.10. Here it is seen that the approximants Hk ( A0), k = 1, 2, . . . , may themselves provide interesting models for biological objects and may have their own applications in computer graphics.
Deterministic calculation of measure attractors
In practice, in two-dimensional situations it is quite difficult to compute deterministic sequences of approximations to the measure attractor μ of a hyperbolic IFS F. The sequence of approximations, starting with μ0, is defined by
μk+1 = F(μk ) = p1 f1(μk ) + p2 f2(μk ) + · · · + pN fN (μk ) for k = 0, 1, 2, . . .
334 Hyperbolic IFSs, attractors and fractal tops
The computed approximation to μk will necessarily be discretized and will not provide the value of μk on sets other than those defined by discretization; this leads to difficulties in the iterative step.
For example, suppose we know that the support of μ is contained in R2 and
construct approximations |
μ |
to |
{ |
μ |
, where μ is defined by an array |
|||||||||||
we want to (k) |
: w {1, 2, . . . , |
|
} |
|
{ k } |
|
k } |
|
|
|
k |
|
|
|
× |
|
of pixels {Pw,h |
W |
|
{1, 2, . . . , H }}, |
|
|
|
||||||||||
|
|
|
, h |
|
|
|
|
} |
of fixed resolution W |
|
||||||
H . The domains of the pixels { w,h |
: w {1, 2,(k) |
|
, h |
{ |
1, 2, . . . , H |
}} |
, form |
|||||||||
|
|
|
|
|
|
|
|
. . . , W |
|
|
|
|||||
a partition of . Then in order to compute Pw,h we need to know the value of μk ( fn−1( w,h )), which is not available except in the special case where each fn−1 maps the set of boundaries of the pixel domains into itself. So, in practice, where we are constrained to a fixed resolution it is generally necessary to make further approximations over and above the discretization step.
Nonetheless, sensible sequences of approximations can be obtained in this way, as illustrated in Figure 2.23. As in the case of the set attractor, when dealing with two-dimensional hyperbolic IFSs a much easier approach is to use algorithms based on the chaos game, as was explained and justified in Section 4.5.
Deterministic calculation of pictures?
Let F denote a hyperbolic IFS of one-to-one transformations. Then we define F : C(X) → C(X) by
F(P) = f1(P) f2(P) · · · fN (P) for all P C(X). |
(4.8.2) |
Can we find pictures that are invariant under the IFS F by recursive application? In particular, does the sequence of pictures, starting from a given P0 C(X), specified by
Pk+1 = F(Pk ) = f1(Pk ) f2(Pk ) · · · fN (Pk ) for k = 0, 1, 2, . . . ,
converge to a single limiting picture?
The answer is: ‘Generally, it does not!’ But the way in which the sequence {Pk }∞k=0 may fail to converge is very interesting, because it illustrates the ergodic theorem and because it inspired the discovery of fractal tops and colour-stealing.
Let us look at a two-dimensional pictorial example, illustrated in Figure 4.11. F is defined by the IFS code in Table 4.8. It consists of four transformations. The initial picture P0 is illustrated at the top left of Figure 4.11. From left to right and from top to bottom the figure shows approximate pictures of some of the sequence P0, P1, P2, . . . Let the domain of Pk be denoted by Ak , and suppose that A0 is compact. Then by Equation (4.8.1) in Theorem 4.8.1 the sequence of sets Ak+1 = F( Ak ) converges to the set attractor A of F. It is apparent in Figure 4.11 that the domains of the pictures converge towards some limiting leaf-shaped set. Indeed, to the printed resolution, the domain of the last panel is probably an accurate representation of the set attractor. But what of the colours?
4.8 Deterministic calculation of attractors |
335 |
Table 4.8 Projective IFS code used in Figures 4.11–4.13, as illustrated below
n |
an |
bn |
cn |
dn |
en |
fn |
gn |
hn |
jn |
pn |
|
1 |
0.8 |
0 |
0.1 |
0 |
0.8 |
0.04 |
0 |
0 |
1 |
1 |
|
4 |
|||||||||||
|
|
|
|
|
|
|
|
|
|
||
2 |
0.5 |
0 |
0.25 |
0 |
0.5 |
0.4 |
0 |
0 |
1 |
1 |
|
4 |
|||||||||||
|
|
|
|
|
|
|
|
|
|
||
3 |
3.55 |
−3.55 |
2.66 |
3.55 |
3.55 |
0.78 |
0 |
0 |
10 |
1 |
|
4 |
|||||||||||
4 |
3.55 |
3.55 |
3.78 |
−3.55 |
3.5 |
4.34 |
0 |
0 |
10 |
1 |
|
4 |
|||||||||||
|
|
|
|
|
|
|
|
|
|
|
Note that the initial image P0 is partitioned into three subsets corresponding to the colours green, yellow and blue. Each successive computed image is made of pixels belonging to a discrete model for and consists of green pixels, yellow pixels and blue pixels. Each pixel corresponds to a set of points in R2. But, for the purposes of computation, only one point corresponding to each pixel is used. When points with different colours, belonging to say Pk , are mapped under one of the transformations fn of F to points in the same pixel in Pk+1, a choice has to be made about which colour, green, yellow or blue, to assign to the new pixel of Pk+1. In the computation of Figure 4.11 we chose to make the new pixel of Pk+1 the same colour as that of the pixel containing the last point in Pk , encountered in the course of running the computer program, to be mapped to the new pixel. The result is that although the sequence of pictures converges to the set attractor of the IFS the colours themselves do not settle down. See Figures 4.12 and 4.13: the successive colours of the same pixel change, iteration after iteration, in a seemingly random manner, even though the set attractor, the support of the sequence of pictures, has stabililized. This behaviour, which we call the texture effect, occurs in many examples at which we have looked; it occurs also in underneath pictures, as noted in Figure 3.26.
A pleasing explanation for the texture effect is provided by the following theorem, which expresses the ergodicity of the hyperbolic IFS F.
T h e o r e m 4.8.2 Suppose that μ is the unique measure attractor for the IFS F. Suppose that B B(X) is such that fm (B) B for all m {1, 2, . . . , M}. Then μ(B) = 0 or 1.
P r o o f See [16]. The proof depends centrally on the uniqueness of the measure attractor. A variant of this theorem, weaker in the constraints on the IFS but stronger in the conditions on the set B and stated in the language of stochastic processes, is proved in [33]. We prefer the present version for its simple statement and direct measure-theoretic proof.
336 |
Hyperbolic IFSs, attractors and fractal tops |
Figure 4.11 Some elements of a sequence of pictures F◦n acting on a picture P0. Whereas corresponding sequences of sets and measures both converge, this sequence of pictures never settles down. See Figure 4.12. The reader will recognize a sequence of underneath pictures . . .
Theorem 4.8.2 provides a simple model explanation for the texture effect, as follows. Assume that the yellow pixels and the blue pixels both correspond to sets of points of positive measure, both invariant under F. Then we have a contradiction to Theorem 4.8.2. So neither the yellow set nor the blue set can be invariant under F. Hence, either one of the sets disappears – which occurs in some other examples – or the pixels must jump around. A similar argument applied to powers of F shows that the way in which the pixels jump around cannot be periodic and hence must be ‘random’. The same argument applies whenever there is more than one colour present in the successive iterates. A more careful explanation involves numerical and statistical analysis of the specific computation.
4.9 Fractal tops
Theorem 4.8.2 tells us that it is tricky to define a picture in such a way that it is invariant under the transformation F : C(X) → C(X). But we would like to find a unique canonical picture that is somehow invariant under F. It turns out that we can achieve this by taking the colour space C to be code space and extending the definition of the hyperbolic IFS F to a new operator FTOP that acts on the colour component as well as the spatial part of a picture. The resulting unique invariant picture is called a fractal top, first mentioned in the Introduction.
In Theorem 3.3.12 we learnt that there exists a continuous transformation
φ : {1,2,...,N } → A
4.9 Fractal tops |
337 |
Figure 4.12 The restless sequence of textures is revealed in this continuation of Figure 4.11.
Figure 4.13 Close-up on the restless textures.
from the code space {1,2,...,N } onto the set attractor A of the hyperbolic IFS F = {X; f1, f2, . . . , fN }. This transformation is defined by
φ(σ ) |
= |
nlim fσ1 σ2 ···σn (x) |
for σ = σ1σ2 · · · {1,2,...,N }, |
|
→∞ |
|
|
for any x X, where we recall that |
|
||
|
|
fσ1 σ2···σn (x) := |
fσ1 ◦ fσ2 ◦ · · · ◦ fσn (x). |
Note that φ : {1,2,...,N } → A interacts with the shift transformation S :{1,2,...,N } → {1,2,...,N } according to the expression
φ(σ ) = fσ1 (φ(Sσ )) for all σ {1,2,...,N }.
338 |
Hyperbolic IFSs, attractors and fractal tops |
The code space = {1,2,...,N } is an ordered space when equipped with the relation < defined by
σ < ω iff σk > ωk ,
where k is the least index for which σk = ωk . Notice that all elements of are less
than or equal to 1 = 11111 · · · and greater than or equal to N = N N N N N · · ·
Also, any pair of distinct elements of is such that one member of the pair is strictly greater than the other.
Now notice that the set of addresses of a point x A, defined to be φ−1(x), is closed. The reason is that A is closed, so A\{x} is open and φ−1( A\{x}) = φ−1( A)\φ−1({x}) = \φ−1(x) is also open. It follows that φ−1(x) is both bounded above and closed, so it must possess a unique largest element. We denote this element by τ (x).
D e f i n i t i o n 4.9.1 Let F be a hyperbolic IFS with set attractor A and code space function φ : → A. Then the tops function of F is τ : A → , defined by
τ (x) = max{σ : φ(σ ) = x}.
The set of points Gτ := {(x, τ (x)) : x A} is called the graph of the top of the IFS or simply the (fractal) top of the IFS.
The top of an IFS may be described as follows: consider the lifted IFS, which we define to be
F = {X × : f 1, f 2, . . . , f N },
where
f n (x, σ ) = ( fn (x), sn (σ ))
and sn (σ ) := nσ := ω, with ω1 = n and ωn+1 = σn for n = 1, 2, . . . Then F is a hyperbolic IFS with respect to the metric
dX× ((x, σ ), (y, θ )) := dX (x, y) + d (σ, θ )
for all pairs of points (x, σ ), (y, θ ) X × , where d is the code space metric defined in Equation (1.6.1). Notice that d (sn (σ ), sn (θ )) ≤ 12 d (σ, θ ) for each n {1, 2, . . . , N }, and so it follows that
dX× ( f n (x, σ ), f n (y, θ )) ≤ max 12 , l dX× ((x, σ ), (y, θ )), where l is a contractivity factor for F.
Let A denote the set attractor of F. Then the projections of A onto X |
||||||||||||
and |
|
|
|
|
F |
is related to |
|
|
|
|||
|
are A and respectively. The top of |
|
|
A according to |
||||||||
|
G |
τ = { |
(x, σ ) |
|
|
|
A |
ω |
≤ |
|
} |
|
|
|
|
= |
|
σ |
. |
||||||
|
|
|
A : (x, ω) |
|
|
|
|
|
||||
4.9 Fractal tops |
339 |
This formulation is useful because it makes it obvious how we can use the chaos game, applied to F, to approximate Gτ and hence τ . We simply keep track of the ‘highest’ values encountered along random orbits. In practice, in the twodimensional case, we assign a set of pixels to a discretized approximation to the
attractor A of F. The value of each pixel is initialized to N , the lowest possible value. Then, starting at a point of the form X0 = (x0, N ) A × , we simply follow a random orbit X1, X2, . . . , namely
Xk+1 = (xk+1, σk+1σk · · · σ1 N ) = f σk+1 (Xk ) for k = 0, 1, 2, . . .
generated by the chaos game. At the (k + 1)th step, the value of the pixel in which the point xk+1 lies is updated to become σk+1σk · · · σ1 N if the latter is greater than the current value of the pixel. The values of the pixels are kept truncated to a fixed length.
Many variations on this algorithm are feasible. Another method for computing approximations to τ follows the deterministic orbits of an associated dynamical system, called the tops dynamical system, as described in Corollary 4.11.4.
As an example of a fractal top and its associated structures, consider the IFS
F1 = {[0, 1] R; f1(x) = αx + (1 − α), f2(x) = αx}, |
(4.9.1) |
where
12 < α < 1.
The attractor of F1 is the closed real interval [0, 1]. It follows that F1 is overlapping because f1([0, 1]) ∩ f2([0, 1]) contains a nonempty open set. The lifted IFS associated with F1 is
|
|
F1 = [0, 1]× {1,2} R; f 1(x, σ ) = (αx + (1 − α), 1σ ), f 2(x, σ ) = (αx, 2σ ) . (4.9.2)
In order to compute a picture of the attractor A1 of F1 we embed the code space{1,2} in [0, 1] by identifying it with the Cantor set generated by the IFS
{[0, 1]; w1(y) = 0.49999y + 0.50001, w2(y) = 0.49999y}.
Accordingly, in Figure 4.14 we illustrate the attractor A1 of the IFS
F1 = {[0, 1] × [0, 1] R2; (αx, w1(y)), (αx + (1 − α), w2(y))},
for the case α = 23 . This was computed using the chaos game. The top of F1 corresponds to the literal top, shown in red, of the set A1 plotted in Figure 4.14.
E x e r c i s e 4.9.2 It is sometimes convenient to think of the real interval [0, 1], written in binary notation, as a representation of code space. This does not lead to
