Newsgroups: sci.image.processing
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!ix.netcom.com!netcom.com!adt
From: adt@netcom.com (Anthony D. Tribelli)
Subject: Detecting circular arc segments?
Message-ID: <adtD0A4A1.DJJ@netcom.com>
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
X-Newsreader: TIN [version 1.2 PL1]
Date: Sun, 4 Dec 1994 09:13:12 GMT
Lines: 24

I am currently a graduate student working on a thesis in the field
of computer vision. My research currently centers on detecting
circular features in an image. These features may not be complete
circles, they may only be arc segments. I am already familiar with
the Hough technique [Ballard and Brown, 1982, Computer Vision,
p. 123].

The specific project involves scoring a target. Software analyzes
a rifle or pistol target, finds scoring rings and holes, and
computes the shooter's score. The core problem is to correctly
identify overlapping holes. Overlapping holes will appear as
various "blobs" rather than neat circles. Hough begins to fail
if there is too much overlap. I expect I will need to reconstruct
circles from arcs, anaylze the area/perimeter of blobs, etc...

I am beginning a literature search. I would appreciate any
references you may think are relavent.

Thanks for any suggestions, references, etc...

Tony Tribelli
adt@netcom.com


