Jump to content

Circle detection algortihm


Recommended Posts

Improved General Circle Detection Algorithm

Tomasz Macura

This paper considers the problem of detecting circles in binary images on parallel computers. The author presents improvements to the General Circle Detection Algorithm (GCDA) that was invented by A. Kavaianpour, S. Shoari, and N. Bagherzadeh. The GCDA is based on a transformation that converts circles in an image to families of straight lines. This reduces the problem of circle detection to that of line detection which may be solved by any line detection algorithm. Theoretical analysis of the performance of the Improved General Circle Detection Algorithm (IGCDA) suggests that speedup will be linear. The author's implementation of the IGCDA on a Beowulf cluster of generic personal computers achieved the predicted speedup.

Faculty mentor: Matthias K. Gobbert



Not sure how efficient algorithms you are looking for :thumbsup:


Edit: If you are looking for something in pdf format:



“He who joyfully marches to music in rank and file has already earned my contempt. He has been given a large brain by mistake, since for him the spinal cord would surely suffice.” - Albert Einstein

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
  • Create New...