Improved Curve Detection Through Decomposition of the Hough Transform
Loading...
No Access Until
Permanent Link(s)
Collections
Other Titles
Authors
Abstract
This paper describes techniques to perform fast and accurate curve detection using a variant of the Hough transform. It is shown that the Hough transform can be decomposed into many small subproble ms, where each subproblem considers only curves that pass through some subset of the points. These curves correspond to a manifold in the parameter space. This property allows the effects of localization error to be modeled more accurately than previous systems. The additional use of randomization techniques leads to efficient algorithms. The time required by this method is $O(n)$, where $n$ is the number of edge poin ts in the image, if we are only required to find curves that are significant wit h respect to the complexity of the image. Results are given showing the detecti on of lines and circles in real images.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
1995-05
Publisher
Cornell University
Keywords
computer science; technical report
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1516
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
technical report