About: Hough Transform   Sponge Permalink

An Entity of Type : owl:Thing, within Data Space : 134.155.108.49:8890 associated with source dataset(s)

The Hough Transform, originally described in a patent by Paul Hough, is a point-to-curve transformation, that has many applications in pattern recognition. It can detect the presence of a parametrically representable group of point in a bitmap image, such as a straight line or a circle, through a mapping to a parameter space. This is regarded as an n-dimensional matrix of accumulator (where n = number of parameters of the shape of interest). Each significant point from the original set casts a vote in one or more slots in the accumulator matrix. Thus, looking for a pattern of interest in the original space corresponds to searching for peak values in the n-dimensional space.

AttributesValues
rdfs:label
  • Hough Transform
rdfs:comment
  • The Hough Transform, originally described in a patent by Paul Hough, is a point-to-curve transformation, that has many applications in pattern recognition. It can detect the presence of a parametrically representable group of point in a bitmap image, such as a straight line or a circle, through a mapping to a parameter space. This is regarded as an n-dimensional matrix of accumulator (where n = number of parameters of the shape of interest). Each significant point from the original set casts a vote in one or more slots in the accumulator matrix. Thus, looking for a pattern of interest in the original space corresponds to searching for peak values in the n-dimensional space.
sameAs
dcterms:subject
abstract
  • The Hough Transform, originally described in a patent by Paul Hough, is a point-to-curve transformation, that has many applications in pattern recognition. It can detect the presence of a parametrically representable group of point in a bitmap image, such as a straight line or a circle, through a mapping to a parameter space. This is regarded as an n-dimensional matrix of accumulator (where n = number of parameters of the shape of interest). Each significant point from the original set casts a vote in one or more slots in the accumulator matrix. Thus, looking for a pattern of interest in the original space corresponds to searching for peak values in the n-dimensional space. Example: a line can be parameterized by two parameters (slope and intercept, e.g.). Construct a parameter space array votes[slope][intercept] initialised to 0. Then, for every (x,y) point in the image that could be on a line (e.g. output of an edge detector) add 1 to every (slope,intercept) combination that this point could lie on.
Alternative Linked Data Views: ODE     Raw Data in: CXML | CSV | RDF ( N-Triples N3/Turtle JSON XML ) | OData ( Atom JSON ) | Microdata ( JSON HTML) | JSON-LD    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3217, on Linux (x86_64-pc-linux-gnu), Standard Edition
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2012 OpenLink Software