Talk:Circle Hough Transform

Algorithm
This algorithm is not correct

For each pixel(x,y) For each radius r = 10 to r = 60 // the possible radius For each theta t = 0 to 360 // the possible  theta 0 to 360 a = x – r * cos(t * PI / 180); //polar coordinate for center b = y – r * sin(t * PI / 180); //polar coordinate for center A[a,b,r] +=1; //voting end end end

This is not for EACH pixil(x,y)

This is for EACH POSITIVE PIXIL(x,y)

It if is positive then it is potentially on a circle edge, and then the parameter space can also have a center result that will be polled

If you treat all the (x,y) pairs as positive, then you will get upto infinite noise