Slashdot Mirror


Evolution of Mona Lisa Via Genetic Programming

mhelander writes "In his weblog Roger Alsing describes how he used genetic programming to arrive at a remarkably good approximation of Mona Lisa using only 50 semi-transparent polygons. His blog entry includes a set of pictures that let you see how 'Poly Lisa' evolved over roughly a million generations. Both beautiful to look at and a striking way to get a feel for the power of evolutionary algorithms."

25 of 326 comments (clear)

  1. Source code by Anonymous Coward · · Score: 5, Insightful

    Is the source code available for this? It'd be a fun project to learn from and play around with.

    1. Re:Source code by elvstone · · Score: 5, Informative

      He says in the comments that he's supposed to release the source today.

      The source is apparently C# using .NET 3.5, so might take a bit of work to get running under e.g. Mono, should you be on a non-Windows platform.

  2. Any GA implementation.. woo by QuantumG · · Score: 4, Funny

    Genetic Algorithms are like the AI equivalent of text editors... everybody has spent a weekend writing one at some point.

    --
    How we know is more important than what we know.
    1. Re:Any GA implementation.. woo by martin-boundary · · Score: 4, Funny

      And afterwards it's just like the creationism vs evolution debate... everybody wonders what God was thinking when he wrote vi.

    2. Re:Any GA implementation.. woo by QuantumG · · Score: 4, Funny

      umm, Knuth didn't write vi, Bill Joy did.

      --
      How we know is more important than what we know.
    3. Re:Any GA implementation.. woo by QuantumG · · Score: 5, Funny

      Knuth uses pen, paper and toggle switches.. the way it's meant to be done.

      --
      How we know is more important than what we know.
    4. Re:Any GA implementation.. woo by ivucica · · Score: 4, Interesting

      Real world application?

      At our Faculty (www.fer.hr), reservations for "lab practices" is done via genetic algorithms. It's kinda hard to assemble over 500 people for your class to be assigned times when they don't have any other class (there are numerous combinations of classes one can take), and to reduce the time which they have to wait after their last class ends before they are meant to go to the "lab practice".

      In case I didn't make much sense -- optimal schedules for students!

    5. Re:Any GA implementation.. woo by Bob-taro · · Score: 5, Funny

      Vi is divine. Emacs is the work of man.

      vivivi is the editor of the beast.

      --
      Prov 9:8 Do not rebuke mockers or they will hate you; rebuke the wise and they will love you.
  3. Triangles by prockcore · · Score: 5, Interesting

    I would've liked to see it done with triangles... complex polygons just feels a bit like cheating. Not that it isn't super cool.

    On reddit, someone posted another neat GA algorithm which evolves a car to match terrain:

    http://www.wreck.devisland.net/ga/

    1. Re:Triangles by prockcore · · Score: 4, Informative

      It does.. for every generation it makes 20 mutations.. so you're seeing each of those 20 mutations run. Takes a while just for one generation to complete.

    2. Re:Triangles by syousef · · Score: 5, Funny

      I would've liked to see it done with triangles... complex polygons just feels a bit like cheating. Not that it isn't super cool

      Here it is done with 914400 tiny coloured pixe^H^H^H^Hrectangles:

      http://avline.abacusline.co.uk/pictures/jpeg/pics/mona.jpg

      --
      These posts express my own personal views, not those of my employer
    3. Re:Triangles by Half-pint+HAL · · Score: 5, Informative

      the point of genetic evolution is for there to be progressive enhancements. it's not just randomly throwing the dice over and over again. you have to retain the positive enhancements of past iterations for it to "evolve."

      Not entirely true. Let's get back to basics, and hill-climbing algorithms.

      You have a robot and a hill, and you program the robot to always take the steepest uphill slope possible. That's progressive enhancement -- it's always getting "better" (higher).

      Except for one type of thing: local maxima.

      You see, most hills have more than one summit.

      So if the robot ends up on a lower, secondary summit, it will refuse to go down, as it must get better/higher with each step.

      But logically, to get from a lower peak to a higher one, you have to descent a short distance and then start ascending the true summit.

      Any search strategy has to account for local maxima and other dead ends, and in GA and other evolutionary algorithms, these means introducing the possibility that children are less optimal than their parent iterations.

      HAL.

      --
      Got them moderator blues I blieve I walk out the do', With these mod-points I been gettin', I 'most never post no mo'
    4. Re:Triangles by TheRaven64 · · Score: 5, Interesting

      Which brings us to a real use for this kind of thing. Depending on how fast it runs, it could be an interesting form of image compression. 50 polygons is generally a lot less data than 914400 rectangles. For higher quality, you could add more polygons. You then get a resolution-independent version of the original image with some loss of quality. I'm not sure if it's more interesting than topology-based compression, but it's certainly an interesting avenue.

      --
      I am TheRaven on Soylent News
  4. Not genetic programming by Anonymous Coward · · Score: 5, Informative

    One individual trying to improve itself isn't evolution, it's simulated annealing. Just because you call your parameters "DNA" it doesn't turn it into genetic programming.

    Genetic programming requires a population and a crossover operation.

    1. Re:Not genetic programming by usul294 · · Score: 4, Informative

      It doesn't necessarily require crossover, asexual reproduction that selects based on merit and uses mutation will have an evolving population, though generally not as fast as with crossover.

    2. Re:Not genetic programming by khallow · · Score: 4, Informative

      One individual trying to improve itself isn't evolution, it's simulated annealing. Just because you call your parameters "DNA" it doesn't turn it into genetic programming.

      But doesn't simulated annealing involve quenching? That is, there's a "temperature" of the system. High temperature means states are more likely to make big random jumps to far from optimal states. Low temperature means the jumps are shorter and more optimal is strongly prefered. Here's what I dimly recall. As the temperature declines, the more fit states become higher prefered. If you cool too rapidly (there is a mathematical view in which that statement makes sense), you risk getting stuck in a suboptimal extreme state. But cooling at a rate of time to the -0.5 power settles to a optimal state as long as the optimal state is isolated, I think. In comparison, the algorithm of the story appears to be constant temperature with respect to time.

      Another aspect of simulated annealing is that it doesn't take the best fit at each generation. By randomly mutating at each step and lowering the temperature slowly as above (and making more optimal states increasingly prefered), the problem naturally settles to an optimal state. In comparison, the algorithm mentioned in the story takes the best fit at each generation.

      It appears to me not to fit very well in the viewpoint of simulated annealing.

  5. Not genetic, still a good demonstration by usul294 · · Score: 4, Interesting

    As someone who has written a few genetic algorithms for optimization in systems I've engineered, this really shows off the inherent power. Yeah, its not going to get a perfect answer, but sometimes its quicker and easier to get genetically optimized than to do the optimization by hand. After reading Selfish Gene and doing GA's, it really gave be an appreciation for the beauty of evolution and its mechanism.
    Its not genetic programming because theres only phenotype being evaluated each generation(the image). If the algorithm had 10 individual sets that traded polygons somehow, with a tendency for the pictures closer to the Mona Lisa to get reproduction preference, then it would be genetic.

  6. Re:Pretty Cool But Not Evolution in the Usual Sens by Roland+Piquepaille · · Score: 5, Funny

    Evolution with a comparison function is called intelligent design. Here for example is the code snipped that created man (from the good book):
    ...
    while(strcmp(image(man),image(god)))
    {
        free(man);
        man=(man_t*)malloc(sizeof(man_t));
    }
    bless(man); ...

  7. If you like this story... by greg_barton · · Score: 4, Informative

    ...you'll love Picbreeder: picbreeder.org

  8. A similar project by dmomo · · Score: 4, Interesting

    I did something very similar. Instead of random polygons, I used random circles. I would choose the best and then clone it... adding a random circle to each.

    http://www.eigenfaces.com/

    An interesting thing, I found, was to take a handful of low-quality creations and "average" them out. You end up with more detail.

    1. Re:A similar project by dmomo · · Score: 4, Interesting

      Oh... I forgot to mention. I also tried it against some video. It seems that by adding motion, you percieve even more detail. This is about 20 frames with a resolution of about 1000 generations each.

      http://www.eigenfaces.com/img/morphs/anim-100x20.gif

      This was all done with Python / Pygame. A great little package for those who are keen to dabble

  9. This is not a "genetic algorithm" by haggais · · Score: 5, Informative

    Sorry, but this is hill climbing, pure and simple. The (very cool) result was achieved by introducing random changes ("mutations", if you like) into a "state" or "temporary solution" (the set of polygons), and keeping the new state only if it increases a target function (the similarity to a target image).

    The name "genetic algorithm" is actually used for a more complex situation, more reminiscent of our own genetics: the algorithm maintains a pool of states or temporary solutions, selects two (or more) of them with probability proportional to their target-function score, and then randomly recombines them, possibly with "mutations", to generate a new state for the pool. A low-scoring state is probably removed, to keep the pool at constant size.

    Quite possibly, a genetic algorithm would do an even better job here, as it could quickly find, for example, two states which each approximates a different half of the image.

  10. Re:Brilliant! by Alsee · · Score: 4, Interesting

    I have hobby expertise in this subject. I've studied the subject in general, I have studied the math behind it, and I have programmed several evolving systems.

    You always need a target.

    Nope. Evolution works great even when you don't have the faintest clue what a successful "target" might look like. In fact evolutionary methods are most valuable exactly when you lack a lack a target and when you are unable to "intelligently design" a solution yourself.

    The technical term for what you need is a 'fitness function'.

    However even that overstates what you need. While it is convenient if you have a function to numerically evaluate fitness, all you really need is a comparison ability - some means of comparing individual A and individual B and selecting which on is "better", for any definition of "better". It doesn't even have to be an absolute or accurate comparison - all you need is some means of selection that chooses the "better" individual more than 50% of the time.

    As for this article, it is a visually nice demo for introducing people to the subject, but in fact it uses one of the most limited and least powerful aspects of evolving processes. It is a simple asexual hillclimbing of a single individual.

    Sexual recombination in an evolving population is almost infinitely more powerful. There's some deep mathematics behind the power of sexual recombination, but it is so powerful that essentially all species above bacteria have seized on it. Asexual reproduction has many obvious advantages and simplicity, but virtually all species abandon it whenever possible because sexual recombination is where the real power lies in evolution.

    -

    --
    - - You can't take something off the Internet! That's like trying to take pee out of a swimming pool.
  11. Feeding the troll... by bondsbw · · Score: 5, Insightful

    Had this consumer sheep instead opted to use a superior, Open Source operating system, then he could have posted the source code to Sourceforge or something similar, and had the community as a whole inspect the source.

    What's stopping him from doing this using Windows?

    This would have led to an algorithm that would have required less generations, and used less polygons.

    Really? I never knew Windows caused bad algorithms.

    I'm as anti-big corporation and anti-Microsoft as anyone I know, but I'm getting a little tired of these posts that have no thought added. .NET is about as close to open as anything that Microsoft has developed. Just because Microsoft didn't make Mono doesn't mean that they are against it... they just have no business reason to create something that the open source community can do.

    .NET/Mono are excellent runtimes, and C# is a very good and powerful language. Multiple languages compile to the same bytecode so that practically anyone can jump in and start. And it gives a great alternative to Java.

    --
    All my liberal friends think I'm a conservative, all my conservative friends think I'm a liberal.
    1. Re:Feeding the troll... by darkpixel2k · · Score: 4, Funny

      And it gives a great alternative to Java.

      I have a great alternative to being burned alive. It's being beaten to death with a baseball bat.

      --
      There's no place like ::1 (I've completed my transition to IPv6)