Newsgroups: sci.image.processing
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!gatech!swrinde!pipex!news.sprintlink.net!sunserver.insinc.net!news.Direct.CA!scipio.cyberstore.ca!vanbc.wimsey.com!news.bc.net!newsserver.sfu.ca!fornax!apurva
From: apurva@cs.sfu.ca (setenv DISPLAY hostname:0)
Subject: Re: Looking for Hough Transform Code
In-Reply-To: <BRG.95Apr24141901@gorp>
Message-ID: <1995Apr28.204128.8275@cs.sfu.ca>
To: brg@gorp
Organization: Faculty of Applied Science, Simon Fraser University
Date: Fri, 28 Apr 1995 20:41:28 GMT
Lines: 19

I have some h.t. code unfortunately I cant forward the codes to
you.. However, I can forward you a detailed algorithm to find circles
using h.t.  ellipse should be an extension to it i
guess. (theoritically it should be the other wya around anyways..)

One fatastic book to refer is " Shape detection in computer vision
using hough transforms" by Leavers.. (i forget the initials)..

That should basically give u a good idea of how to code..

a simple h.t. code to find lines can be found in:
Hand book of image processing...

hope that helps.. 
email me at apurva@cs.sfu.ca for a detailed H.T. algorithm

Apurva


