Hough Transform 1.1 2007/12/19 18:41:49.613 US/Central 2007/12/19 18:43:21.876 US/Central Thomas Yeh tyeh@rice.edu Thomas Yeh tyeh@rice.edu

And now, Introducing the Hough Transform… We are finally about to get to the fun part: circle detection…

The Hough Transform The Hough Transform is performed to recognize circular patterns based on parameters such as circle radius range, gradient threshold and presence of concentric circles. The Hough Transform will in as an input a range of radii. It will then generate circles of varying radii which cover the entire range. These circles are convolved with the image and the goodness of match is recorded in an accumulation array. Note: Generally, convolution is not performed, but rather, the FFTs are taken and multiplied together. This is not only more efficient, but more easily implemented as well! We found a nifty Matlab function which implements the transform and ran it on our image. The accumulation graph can be seen below, with the peaks corresponding to the best circle matches.

Circles, Circles, Circles! With the circles detected, the areas where the best circular matches were can be drawn out in our original image. The result is quite striking: of the twelve or so cells which could be picked out by the human eye, the Hough Transform was able to detect roughly eight cells.