The dynamic generalized Hough transform: Its relationship to the probabilistic Hough transforms and an application to the concurrent detection of circles and ellipses (Q3136025)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 416894
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The dynamic generalized Hough transform: Its relationship to the probabilistic Hough transforms and an application to the concurrent detection of circles and ellipses |
scientific article; zbMATH DE number 416894 |
Statements
The dynamic generalized Hough transform: Its relationship to the probabilistic Hough transforms and an application to the concurrent detection of circles and ellipses (English)
0 references
22 September 1993
0 references
probabilistic Hough transforms
0 references
dynamic generalized Hough transform
0 references
circles
0 references
ellipses
0 references
0.7967981696128845
0 references
0.7965995669364929
0 references
0.7953633666038513
0 references
0.789638876914978
0 references
0.7836056351661682
0 references
The dynamic generalized Hough transform (DGHT) differs from other SHT and PHT algorithms in two fundamental ways. The first difference is that the algorithm selects a single connected point, \((x_ c,y_ c)\), and uses this point to seed the transformation. The \(n\) parameters associated with the shape under detection are calculated using \((x_ c,y_ c)\) together with sets of \((n-1)\) randomly sampled image points. In this way voting is constrained to be on the hypersurface in transform space which would be generated by the standard transformation of \((x_ c,y_ c)\). The algorithm maps each set of \(n\) image points to a single point on this surface. Voting is further restricted by appropriate segmentation of the image data. The second fundamental difference exploits the production of a sparse transform space by projecting the results of the transformation onto the axes of the \(n\)-dimensional transform space. Hence if \(T\) is the resolution in transform space and \(n\) is the number of parameters under detection then use of the DGHT reduces memory requirements from \(T^ n\) to \(nT\) and introduces the opportunity for parallel calculation and accumulation of parameters. a robust stopping criterion is deduced for the DGHT. This is applied to the concurrent detection of circles and ellipses using real image data over a range and variety of noise conditions.
0 references