Robust Circle Detection Using Harmony Search

Algorithm 1

The Harmony Search algorithm.

     input: A fitness function for scoring the solutions along with

      an upper bound (UB) and lower bound (LB) for each

      dimension of the -dimensional solution. A function,

      , for sampling random numbers between and

      from a uniform distribution is also required.

      output: The best solution

()     Initialise the HM with random entries

()    foreach do

()     foreach do

()      if then

()        

()      else

()        

()        if  then

()       

()    end

()   end

()  

()       end

()       select the lowest scoring solution    from the HM

()       if then

()     remove    from and replace with  

()  end

()  select the highest scoring solution    from the and return it