END OF AN ERA, FRACTALFORUMS.COM IS CONTINUED ON FRACTALFORUMS.ORG

I rewrote an old Buddhabrot renderer of mine from Processing to JavaScript / Canvas: http://alexsimes.com/index.php?foo=visual%20programming&bar=buddhabrot

There is another post on the process (was originally meant to be a question on how to optimize it but ended up being largely a monologue of what I was doing to speed it up, ha ha): http://www.fractalforums.com/programming/buddhabrot-optimizations/

General summary of what it is doing:
- Each color channel (red, green, and blue) is treated as a separate Buddhabrot. Each color channel has its own maximum iterations for the Mandelbrot Set equation. Before running any code related to adding orbit traps, all pixels that do not belong to the Mandelbrot Set are found (for each color channel).

- The function for adding orbit traps alternates between the color channels. Each time a channel is chosen it tries to add 10,000 orbit traps. The random starting points are selected from an array of pixels that do not belong to the Mandelbrot Set (the last bulleted step). The pixel has a random deviation added to it (for a greater range of starting points) and then it is converted to the complex plane. If the random point still does not belong to the Mandelbrot Set after the random deviation is added, then it contributes to the appropriate value buffer depending on what color channel is being used.

- After 10,000 attempts (mostly successful) of adding orbit traps, the chosen color channel has a histogram made based on its value buffer. Using a cumulative distribution function the orbit traps for the chosen color channel are set to the normal 0 - 255 range but with a high contrast regardless of the state of the value buffer (due to the cumulative distribution function). An explanation of this process can be found here: http://en.wikipedia.org/wiki/Histogram_equalization#Small_image

I have the feeling that you're doing something wrong.
Can i get the source code please ?