Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:

Ohrimenko+ / Barnsley. Superfractals

.pdf
Скачиваний:
90
Добавлен:
11.06.2015
Размер:
31 Мб
Скачать
☆

340

Hyperbolic IFSs, attractors and fractal tops

Figure 4.14 The attractor A 1 of the IFS in Equation (4.9.2). This attractor is related to the attractor A 1 of the lifted IFS corresponding to Equation (4.9.1) by the embedding of the code space {1,2} in the interval [0, 1] on the y -axis, as described in the text. The top of the IFS is indicated in red.

problems except possibly at those points on [0, 1] that have two representations. Explain how we have avoided such problems in the example based on Equation (4.9.1).

Now we mention the following result, because it is in a similar vein to the one above. It spells out how each measure attractor of F is the transformation under φ : → A of a canonical measure on code space.

T h e o r e m 4.9.3 Let μ P(X) denote the measure attractor of the hyperbolic IFS F = {X; f1, f2, . . . , fN ; p1, p2, . . . , pN } and let μ P( ) denote the measure attractor of the IFS S = { ; s1, s2, . . . , sN ; p1, p2, . . . , pN }, where sn : → is the branch transformation defined by sn (σ ) = nσ for all σ , and let μ P(X × ) denote the measure attractor of the hyperbolic IFS F = {X× :f 1, f 2 . . . , f N ; p1, p2, . . . , pN }, where f n = ( fn , sn ), for n = 1, 2, . . . , N . Then

4.10 Pictures of tops: colour-stealing

341

the projections of μ Moreover,

P(X × ) onto P(X) and P( ) are μ and μ respectively.

μ = φ(μ ).

P r o o f This is straightforward and is based on the uniqueness of the three measure attractors and the continuity of φ. See for example [48], Theorem 4.4(3), (4).

4.10Pictures of tops: colour-stealing

In later sections we will see that the mathematics of fractal tops is very deep. But we have, in some ways, hurried to get to this section, where we shall explain how to make beautiful pictures of fractal tops using colour-stealing. The colour-stealing method has potential applications in computer graphics, image processing, image watermarking and image compression.

Here we are concerned with picture functions of the form P : DP R2 → C, where C is a colour space; for example, C = [0, 255]3 R3. For colour-stealing applications we may choose

DP = := {(x, y) R2 : 0 ≤ x, y ≤ 1}.

Let two hyperbolic IFSs

FD := { ; f1, f2, . . . , fN } and FC := { ; f 1, f 2, . . . , f N }

and a picture function

PC : → C

be given. The index ‘D’ stands for ‘drawing’ and the index ‘C’ stands for ‘colouring’. Let AD denote the attractor of FD and let AC denote the attractor of FC . Let

τD : AD →

denote the tops function for FD and

φC : → AC

denote the addressing function for FC . Then we define a new picture

PD : AD → C

by

PD = PC ◦ φC ◦ τD .

The picture PD is uniquely defined by FD , FC and the picture PC . We say that PD has been produced by tops plus colour-stealing and we sometimes call it the

342 Hyperbolic IFSs, attractors and fractal tops

stolen picture. We think in this way: first we ‘steal’ colours from the picture PC , to ‘paint’ code space, that is, we make a code space picture, PC ◦ φC : → C; then we combine the latter with the top of FD to ‘paint’ the attractor AD .

The stolen picture PC ◦ φC ◦ τD may be computed by algorithms based on a variant of the chaos game, in which the lifted IFS associated with FD is coupled to the IFS FC . This is the method used to compute many of the rendered pictures of fractal tops in this book and is described in more detail in [15] and [18]. Briefly, we play two chaos games simultaneously, one using FC in which the current point xkC dances around on the picture PC and the other, using FD , in which the current point xkD dances around on , so to speak ‘drawing’ on a blank sheet of paper while keeping track of the code space index, say σk σk−1 · · · σ1 N . At the (k + 1)th roll of the die, the same selected map index σk+1 is used to fix the transformation to apply in each game; a point xkD+1 which either has not been coloured or has already been coloured, and for which the new code space value σk+1σk σk−1 · · · σ1 N is greater than all previous code space values associated with that location, is assigned the colour PC (xkC ).

For example, for Figure 4.15, FD was the Mobius¨ IFS, consisting of four transformations obtained by composing the Mobius¨ IFS represented in Table 4.1 with itself. The colouring IFS was

FC = ; 12 x, 12 y , 12 (x + 1), 12 y , 12 x, 12 (y + 1) , 12 (x + 1), 12 (y + 1) . (4.10.1)

In each case the picture PC was resized to make its domain equal to . Compare the two rendered fractal tops here with the set attractor and the measure attractor in Figure 4.3. Only the upper portion of the picture PC , used to make the right-hand image in Figure 4.15, is shown. But by using a digital camera and by reversing the roles of FC and FD you can approximate the missing portion.

Notice the following facts. (i) Picture functions have properties that are determined by their sources: digital pictures of natural scenes such as clouds and sky, fields of flowers and grasses, seascapes, thick foliage etc. have their own distinctive palettes, relationships between colour and position, apparent continuities and discontinuities and so on. (ii) Addressing functions are continuous. (iii) Tops functions have their own special properties, as we will discuss more fully in the following sections. For example, a tops function is ‘nearly’ continuous, with discontinuities that recapitulate hidden geometrical structures in the underlying set attractor. Thus the pictures produced by tops plus colour-stealing may carry a natural palette and so possess continuity and discontinuity displayed in harmonious and beautiful ways.

These facts are demonstrated in Figure 4.16. Here FD is the projective IFS given in Table 0.1 in the Introduction, and the colouring IFS FC corresponds to a partition

4.10 Pictures of tops: colour-stealing

343

Figure 4.15 Two pictures of fractal tops produced by colour-stealing. The colours were ‘stolen’ from the pictures shown inset. Although these colour transformations are not continuous, they ‘nearly’ are, which accounts for the beautiful groupings of colours.

of into four rectangles whose areas are proportional to the probabilities in Table 0.1. The picture from which the colours were stolen is shown on the right. The whole rendered top, which looks like a leafy tree, as well as a zoom into the region of a tiny hole in the picture, is shown. Notice how the colours tend to be grouped in much the same way as they are in the picture PC , yet none of the structure of PC is preserved. Notice the intricate geometry of the fractal top, revealed in the colouring as well as in the boundaries of its domain. In Figure 4.17 we show, in the centre and right-hand panels, two other colourings for part of the region shown, zoomed, at the left of Figure 4.16. Again, see how different aspects of the top are bought into view by different choices for PC . The panel on the left in Figure 4.17 shows the fractal top partially rendered; this was obtained by stopping the coupled chaos game algorithm before it had run sufficiently long for the picture to stop changing. Another rendering of the same picture is shown in Figure 4.18, which includes an additional zoom and reveals more, potentially endless, diverse beautiful detail. In each case the picture PC was a digital photograph of a real-world scene.

344

Hyperbolic IFSs, attractors and fractal tops

Figure 4.16 A top rendered by colour-stealing (middle image). A zoom is shown on the left. The picture from which the colours were stolen is on the right. A tiny hole in the full image is revealed to have fascinating detail, biological, mysterious.

Figure 4.17 Three renderings of the zoom on the fractal top in Figure 4.16 (also shown in Figure 0.2), computed using a version of the chaos game and colour-stealing. On the left, the computation has been stopped early to produce the effect of mist. Different aspects of the fractal top are revealed by different choices of the picture from which the colours are stolen.

In Figure 4.19 various renderings of the attractor A of a linked projective IFS are shown. A linked IFS is one in which there exist various relations of the form fi (Pi ) = f j (Pj ) between pairs of points Pi , Pj A, with i, j {1, 2, . . . , N }, i =j. Examples of linked IFSs occur often in connection with biological modelling applications; for example, the fractal fern is produced by a linked IFS. They also occur in fractal interpolation and in the construction of space-filling curves (a space-filling curve is an infinitely long curve that winds here and there in a space, eventually visiting every point in the space.). The geometrical properties of projective transformations make them particularly suitable for designing interesting linked IFSs.

Figure 4.20 illustrates a ‘nearly’ continuous invertible transformation between two pictures, at upper left and upper right, achieved by colour-stealing. Clearly, though, this transformation is not a homeomorphism, in contrast with the situation

4.10 Pictures of tops: colour-stealing

345

Figure 4.18 Another colouring photograph PC has been chosen to render this version of the same fractal top as that shown in Figures 4.16 and 4.17. This picture includes an additional zoom, revealing more of the ‘nearly’ continuous transformation of PC and showing something of the intricacy of this single fractal top. The fractal boundaries of the holes may be seen.

discussed in Section 4.15. Here FD is the projective IFS defined in Table 4.3 and FC is given in Equation (4.10.1). The two zooms at the bottom of Figure 4.20 illustrate how the natural clutter of foliage seems more unchanged by the transformation than does the man-made car and the face of the little girl.

In Figure 4.21 two different renderings of the same portion of the same fractal top are shown. The only difference between the two pictures is the picture PC from which the colours were stolen. If you compare the two pictures carefully you will see that there is an underlying geometrical similarity between them. Perhaps they were painted by the same artist? A different example of the same kind is shown in Figure 4.22. You may be struck by the elegant styles of these pictures and their balance and harmony. These effects are typical of the many instances we have observed. Indeed, this ‘beauty effect’ is very pronounced when you put PC as a window into a larger picture, which is shifted continuously in time. Then the stolen picture changes continuously and beautifully, shifting and shimmering, shapes appearing and going away, like patterns in smoke, maintaining the underlying geometry in a very subtle way. The results are breathtaking. Try it!

Colour-stealing has recently been applied in computer graphics; see [71].

E x e r c i s e 4.10.1 What happens when you carry out colour-stealing and two of the transformations in the IFS FD are the same? What happens when two of the transformations in FC are the same?

346

Hyperbolic IFSs, attractors and fractal tops

Figure 4.19 Four different ways of rendering the attractor of a projective IFS are shown here for comparison. The figure shows the set attractor (top left), the measure attractor (bottom left), the set attractor rendered by IFS colouring (bottom right) and the set attractor rendered by colour-stealing (top right). Colours for the latter were stolen from the top left picture in Figure 4.20. But you can treat all these pictures as having been produced by tops plus colour stealing!

E x e r c i s e 4.10.2 Look again at Figure 4.4. These two pictures were actually produced by IFS colouring, as described in Section 4.6. But either could equally well have been obtained from the other via fractal tops plus colour stealing. Which two IFSs would you use to achieve this?

4.11 The tops dynamical system

Here we assume that the transformations of F are invertible. Then we show how the tops function provides a natural dynamical system T : A → A. It is related to another dynamical system T : Gτ → Gτ and to a shift-invariant subspace τ of code space. The notation is the same as above.

4.11 The tops dynamical system

347

Figure 4.20 The relationship between the top two pictures here is the same as that between the two pictures in Figure 4.4, obtained by IFS colouring. Why is this? The zooms at the bottom illustrate differing visual effects on the background clutter, the man-made objects and the human face.

 

L e m m a 4.11.1 Let (x, σ )

 

Gτ . Then ( f

−1(x), Sσ )

 

Gτ .

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

σ1

 

 

 

 

 

 

 

 

 

 

P r o o f

 

 

 

 

 

 

σ1

 

 

Sσ ) is uniquely defined and belongs to X

×

 

 

Notice that ( f −1(x),

 

 

because fn : X

→

X is one-to-one and S :

→

. Suppose that ( f −1(x), Sσ ) /

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

σ1

 

 

 

 

Gτ . Then there

exists

a point

 

( f −1(x), ω)

 

A where

ω > Sσ .

 

But since

A = n f n ( A) it follows that

f σ1

( fσ−1

 

(x), ω)

 

 

 

σ1

( f

σ−1

1(x), ω)

=

(x, σ1

1

 

 

 

 

 

 

 

 

σ1

1

 

 

 

A. However, f

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

ω) and σ ω > σ , which is a contradiction.

 

 

 

 

 

 

 

 

 

 

 

L e m m a 4.11.2 Let (x, σ ) Gτ . Then there exists (y, ω) Gτ

such that

( f

−1(y), Sω)

=

(x, σ )

 

Gτ .

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

σ1

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

P r o o f

Let

(y, ω)

=

( f1(x), 1σ ).

Clearly

( f −1(y), S(1σ ))

=

(x, σ )

and

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

σ1

 

 

 

 

 

 

 

( f1(x), 1σ ) A. We just have to show that ( f1(x), 1σ ) Gτ . Suppose not. Then

348

Hyperbolic IFSs, attractors and fractal tops

Figure 4.21 This shows two different renderings of the same portion of the same fractal top. The only difference between the two pictures is the picture PC from which the colours were stolen. There is an underlying geometrical similarity between them. See also Figure 4.22.

Figure 4.22 See also Figure 4.21. Here too a portion of a fractal top is rendered using the same colouring IFS, FC , but different pictures PC . Breathtaking animated textures can be produced by smoothly varying PC , as in a continuous video sequence.

there exists a point ( f

(x), υ)

A with υ > 1σ . It

follows that υ

1 =

1 and thus

 

 

1

 

 

 

 

1

 

 

that Sυ > σ . Also, since ( f1

(x),

A we have

f 1−

( f1(x), υ) A and hence

(x, Sυ)

 

 

 

 

 

 

υ)

 

 

 

 

 

A. It follows that (x, σ ) / Gτ , which is a

 

 

 

 

 

 

 

 

 

 

contradiction.

 

 

 

 

 

 

 

 

 

 

 

 

 

We may conclude from these two lemmas that the mapping

 

 

 

T : G

τ →

G

τ

 

defined by T (x, σ )

=

w−1(x), Sσ

 

 

 

 

 

 

 

σ1

 

 

is well defined and onto. It can be treated as a dynamical system, which we refer to as {Gτ , T }. As such we may explore its invariant sets, invariant measures, other types of invariants such as entropies and information dimensions and its ergodic properties, using ‘standard’ terminology and machinery, as mentioned in the discussion of the symbolic invariants of orbital pictures in Section 3.5.

 

4.11 The tops dynamical system

 

349

We can project {Gτ

, T

onto the

 

Let

}

 

-direction, as follows. X

}.

τ := {σ : (x, σ ) Gτ for some x

 

Then τ is a shift-invariant subspace of , that is, S : τ → τ with

S( τ ) = τ ,

and we see that { τ , S} is a symbolic dynamical system; see for example [77]. We call τ the tops code space. (We will use the notation F to denote the tops code space of the IFS F.) Indeed, { τ , S} is the symbolic dynamical system corresponding to a partition of the domain of yet a third dynamical system { A, T } corresponding to a mapping T : A → A that is obtained by projecting {Gτ , T } onto A. This system is defined by

 

f1−1

(x)

 

1

 

T (x)

f2−

(x)

 

 

 

.

 

 

.

 

 

= .

(x)

 

fN−1

 

 

 

 

 

 

 

 

 

 

 

 

for all x A, and we have

if x D1 := f1( A),

 

if x D2 := f2( A)\ f1( A),

(4.11.1)

.

.

 

.

.

 

.

.

 

if x DN := fN ( A)\ N −1 fn ( A),

n=1

T ( A) = A.

We call { A, T } the tops dynamical system associated with the IFS. { τ , S} is the symbolic dynamical system obtained by starting from the tops dynamical system { A, T } and partitioning A into the disjoint sets D0, D1, . . . , DN −1 defined in Equation (4.11.1), where

A =

N −1

=j.

 

Dn and Di ∩ D j = for i

 

n=0

 

An example of such a partition is illustrated in Figure 4.23. This illustrates the domains D1, D2, D3, D4 for the tops dynamical system associated with the IFS given in the Introduction in Table 0.1. This was the IFS used in Figures 4.16–4.18.

If the domains {Dn : n = 1, 2, . . . , N } are known then it is easy to compute the tops function. Just follow the orbit of x under the tops dynamical system and keep track of the sequence of indices σ1σ2σ3 · · · visited by the orbit! This is stated formally in Corollary 4.11.4 below.

T h e o r e m 4.11.3 The tops dynamical system { A, T } and the symbolic dynamical system { τ , S} are conjugate. The identification between them is provided by the tops function τ : A → γ . That is,

T (x) = φ ◦ S ◦ τ (x)

Соседние файлы в папке Ohrimenko+