1991
DOI: 10.1049/ip-e.1991.0046
|View full text |Cite
|
Sign up to set email alerts
|

New parallel Hough transform for circles

Abstract: The Hough transform is a well known medium-level image recognition technique for the detection of curves. The conventional Hough technique [I, 21 requires a three-dimensional accumulator array (AA) for the detection of circles.Because shape parameterisation and data structure of the accumulator array significantly affect the memory space and computation loading requirements of any hardware or software realisation, they should be carefully selected for any fast and efficient algorithm. A new scheme which uses o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

1995
1995
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…3b), it was necessary to increase the original resolution from 128 by 128 pixels to 512 by 512 pixels by interpolation. The next step was to locate the centre of each well; this was achieved by converting the edge map data into Hough space by using a modified Hough transform algorithm for circles ( Chan & Siu, 1991). The Hough transform converts a single point in the original edge map into a line in Hough space ( Fig.…”
Section: Methodsmentioning
confidence: 99%
“…3b), it was necessary to increase the original resolution from 128 by 128 pixels to 512 by 512 pixels by interpolation. The next step was to locate the centre of each well; this was achieved by converting the edge map data into Hough space by using a modified Hough transform algorithm for circles ( Chan & Siu, 1991). The Hough transform converts a single point in the original edge map into a line in Hough space ( Fig.…”
Section: Methodsmentioning
confidence: 99%
“…Detecting circles are usually on the basis of circles being special cases of ellipses. For example, the two-staged parameter space decomposition of finding the center first and then other parameters is shown in Chan (1991), using two sets of 2D accumulators. The geometric symmetry is also used in Rad et al (2003), applied on gradient pair vectors, and in Ioannou et al (1999) using the geometric constraint that any chord passes through the circle center.…”
Section: Hough Transformmentioning
confidence: 99%
“…Two-pass algorithms are now classical in Hough-based circle detection [41][42][43], but their first pass is a one-tomany 2d HT, where the votes are made along straight lines, either defined by the gradient direction [41,42], or by the bissector of a point pair chord [43]. In our V2 version, the first pass is a one-to-one DHT based on the isophote curvature.…”
Section: O R E N D F O R Endmentioning
confidence: 99%