Extended DFO Experimentation

This week we have continued working on our optimisation algorithm using DFO and the focus this week was to apply our DFO to a specific problem.

The assigned problem for our DFO is to find the brightest pixels in an image. The image have replaced the sphere function I used in previous post.

In this experiment I am generating a black and white image using perlin noise, I am using the continuous randomising image as my search space. This will make the search space dynamic and the flies will always try to find the brightest pixel. My initial idea was to use the webcam to move the brightest pixel around but I found this more aesthetically appealing. ( I'm a huge fan of perlin noise )

The calculation to get the brightest pixel is very simple, I iterate through all the flies in my population and I take the fly’s current position and subtracting the brightness value from that particular location from 255, which is the maximum brightness. This means that if the current pixel brightness value is higher, the fly’s individual fitness value will be lower. The ideal goal is to have it get towards 0. The fly with the lowest fitness will become the best and the flies will swarm towards the best fly.

This is how the fitness is calculated based on the pixel brightness:

for (auto& f : population){
          f.fitness = 255.0 - surface.getColor(f.position[0], f.position[1]).getBrightness();
}

Here is an example with 100 flies and with a low disturbance threshold:



As you can see, the algorithm works well but they do not seem to behave as a swam might do in nature.

By tweeking the disturbance threshold (dt) you get a very different result. The second example is using more agents and with a higher disturbance threshold, as you can see, the end result is much more interesting when you add more disturbance to the flies.
As you have more flies distributed across the search space I think the behaviour simulates a more natural behaviour.


I find this algorithm to be very interesting, both the visual and the optimisation outcome of this experiment has led me down a path where I want to use this kind of behaviour to control various parameters in a synthesizer and generate interesting music with it.




Comments

Post a Comment

Popular posts from this blog

Physical Computing, Final Project

Image
Physical Computing Final Project Technical Details For my final project, I have made a set of analog synthesizers. What I mean by analog is that I haven’t used any microcontrollers for this project. I will only be working with 9V batteries and a series of different IC’s ( Integrated circuits ). These are the IC chips I have used for my final build: CD4046 CD40106 CD4066 CD4017 LM386 The Synthesizer This is a very simple circuit that is generating a square wave. The small yellow 0.1uF capacitor is the capacitor that is setting the frequency range of the oscillator. The potentiometer is adjusting the fundamental frequency. First oscillator prototype This is how the oscillator sounds: https://youtu.be/j2es7WL2imU The next step is to add more effects to the synthesizer so it sounds a bit more interesting. Next I am setting up another oscillator using the CD40106 chip. The CD40106 is a Hex Schmitt Trigger or more eas
Read more

Dispersive Flies Optimisation ( DFO )

Image
Dispersive Flies Optimisation (DFO) is a global optimisation algorithm that is inspired by observing behaviour of swarming flies in the real world. The algorithm is going through a defined search space and it’s trying to find the most optimal value, which will converge the flies towards their target. We use the DFO to benchmark different test functions for our optimisation. The swarming behaviour of the flies optimisation is based on a value called ‘fitness’. This value judges how optimal the data is and based on the value of the ‘fitness’, it will attract the swarm of flies towards the new found optimal position. During the test of finding the most optimal fitness value, the algorithm is also applying random values to disburse the flies across the search space and away from the best fitness value. This is an attempt to further explore the search space and perhaps find a better potential fitness value. Together with Terry, we implemented the algorithm that was given to us in t
Read more

No Free Lunch Theorem

Image
One thing that loved about the first lecture in this module is that I brought me back a few years back in time when I was taking a stand alone course in Evolutionary Biology at Uppsala University in Sweden. It was a night course I took as I was working because the field have always interested me and I have read many books about the subject. My initial plan was to study biology and become a zoologist. Many of the topics in this module fascinates me and I love when after all these years of technological innovations, we look back at nature and trying to simulate behaviour that we see others entities performing. Evolution has been around for so long that nature is pretty much bound to have figure some useful solutions for us. By reading the paper on “ No Free Lunch Theorem” I found it a bit hard to grasp the overall concept, specifically when you focus on the actual theorem about X being our countable search base and that you have to specify and objective function of f: X ->
Read more