World Library  
Flag as Inappropriate
Email this Article

Fractal flame

Article Id: WHEBN0000505238
Reproduction Date:

Title: Fractal flame  
Author: World Heritage Encyclopedia
Language: English
Subject: Electric Sheep, Iterated function system, Software art, Ultra Fractal, Fractal art
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Fractal flame

A fractal flame created by the Electric Sheep.
Fractal flame created in Apophysis.

Fractal flames are a member of the iterated function system class[1] of fractals created by Scott Draves in 1992.[2] Draves' open-source code was later ported into Adobe After Effects graphics software[3] and translated into the Apophysis fractal flame editor.[2]

Fractal flames differ from ordinary iterated function systems in three ways:

  • Nonlinear functions are iterated in addition to affine transforms.
  • Log-density display instead of linear or binary (a form of tone mapping)
  • Color by structure (i.e. by the recursive path taken) instead of monochrome or by density.

The tone mapping and coloring are designed to display as much of the detail of the fractal as possible, which generally results in a more aesthetically pleasing image.

Contents

  • Algorithm 1
    • Creating the histogram 1.1
    • Rendering an image 1.2
  • Density Estimation 2
  • See also 3
  • References 4

Algorithm

Fractal Flames in High Resolution (20,000 x 20,000 pixels), generated using (Apophysis 7X) software.

The algorithm consists of two steps: creating a histogram and then rendering the histogram.

Creating the histogram

First one iterates a set of functions, starting from a randomly chosen point P = (P.x,P.y,P.c), where the third coordinate indicated the current color of the point.

Set of flame functions: \begin{cases} F_1(x,y), \quad p_1 \\ F_2(x,y), \quad p_2 \\ \dots \\ F_n(x,y), \quad p_n \end{cases}

In each iteration, choose one of the functions above where the probability that Fj is chosen is pj. Then one computes the next iteration of P by applying Fj on (P.x,P.y).

Each individual function has the following form:

F_j(x,y) = \sum_{V_k \in Variations} w_k \cdot V_k(a_j x + b_j y +c_j,d_j x + e_j y +f_j)

where the parameter wk is called the weight of the variation Vk. Draves suggests [4] that all w_k:s are non-negative and sum to one, but implementations such as Apophysis do not impose that restriction.

The functions Vk are a set of predefined functions. A few examples[4] are

  • V0(x,y) = (x,y) (Linear)
  • V1(x,y) = (sin x,sin y) (Sinusoidal)
  • V2(x,y) = (x,y)/(x2+y2) (Spherical)

The color P.c of the point is blended with the color associated with the latest applied function Fj:

P.c := (P.c + (F_j)color) / 2

After each iteration, one updates the histogram at the point corresponding to (P.x,P.y). This is done as follows:

histogram[x][y][FREQUENCY] := histogram[x][y][FREQUENCY]+1
histogram[x][y][COLOR] := (histogram[x][y][COLOR] + P.c )/2

The colors in the image will therefore reflect what functions were used to get to that part of the image.

Rendering an image

To increase the quality of the image, one can use supersampling to decrease the noise. This involves creating a histogram larger than the image so each pixel has multiple data points to pull from.

For example, creating a histogram with 300×300 cells in order to draw an 100×100 px image. Each pixel would use a 3×3 group of histogram buckets to calculate its value.

For each pixel (x,y) in the final image, do the following computations:

frequency_avg[x][y]  := average_of_histogram_cells_frequency(x,y);
color_avg[x][y] := average_of_histogram_cells_color(x,y);

alpha[x][y] := log(frequency_avg[x][y]) / log(frequency_max);  
//frequency_max is the maximal number of iterations that hit a cell in the histogram.

final_pixel_color[x][y] := color_avg[x][y] * alpha[x][y]^(1/gamma); //gamma is a value greater than 1.

The algorithm above uses gamma correction to make the colors appear brighter. This is implemented in for example the Apophysis software.

To increase the quality even more, one can use gamma correction on each individual color channel, but this is a very heavy computation, since the log function is slow.

A simplified algorithm would be to let the brightness be linearly dependent on the frequency:

final_pixel_color[x][y] := color_avg[x][y] * frequency_avg[x][y]/frequency_max;

but this would make some parts of the fractal lose detail, which is undesirable.[4]

Density Estimation

A demonstration of Density Estimation. In the above half, you can see the noise and individual samples. On the below half, rendered with Density Estimation, the noise is smoothed out without destroying the sharp edges.

The flame algorithm is like a Monte Carlo simulation, with the flame quality directly proportional to the number of iterations of the simulation. The noise that results from this stochastic sampling can be reduced by blurring the image, to get a smoother result in less time. One does not however want to lose resolution in the parts of the image that receive many samples and so have little noise.

This problem can be solved with adaptive density estimation to increase image quality while keeping render times to a minimum. FLAM3 uses a simplification of the methods presented in *Adaptive Filtering for Progressive Monte Carlo Image Rendering*, a paper presented at WSCG 2000 by Frank Suykens and Yves D. Willems. The idea is to vary with width of the filter inversely proportional to the number of samples available.

As a result, areas with few samples and lots of noise get blurred and smoothed, but areas with lots of samples and low noise are left unaffected. See https://code.google.com/p/flam3/articles/DensityEstimation.

Not all Flame implementations use density estimation.

See also

References

  1. ^ Mitchell Whitelaw (2004). Metacreation: Art and Artificial Life. MIT Press. pp 155.
  2. ^ a b "Information about Apophysis software". Retrieved 2008-03-11. 
  3. ^ Chris Gehman and Steve Reinke (2005). The Sharpest Point: Animation at the End of Cinema. YYZ Books. pp 269.
  4. ^ a b c The Fractal Flame Algorithm PDF (22.5 MB)
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.