Difference between revisions of "Hough Transform"
Jump to navigation
Jump to search
(added section detailing issues with the current implementation) |
(added link to current implementation of filter) |
||
| Line 1: | Line 1: | ||
| + | This algorithm is implemented as the '''LinearHoughTransform2''' filter for the [[ImageFilterDemo]] program. | ||
| + | |||
A good description is on [http://homepages.inf.ed.ac.uk/rbf/HIPR2/hough.htm this page]. | A good description is on [http://homepages.inf.ed.ac.uk/rbf/HIPR2/hough.htm this page]. | ||
Revision as of 21:32, 21 November 2005
This algorithm is implemented as the LinearHoughTransform2 filter for the ImageFilterDemo program.
A good description is on this page.
Wikipedia also has its own Hough Transform article.
Pros
- Able to detect dashed lines
Cons
- Designed for detecting straight lines, making it tricky to use for curved lines - which will probably be common
- Designed to detect lines as opposed to detecting line segments
- Computationally expensive (when compared to simple filters)
Input
- A binary/grayscale image hilighting the line-pixels in the input image
Output
- A list of the positions/orientations of the lines detected in the input image
Issues with the Current Implementation
- The current implementation does not work well with input images containing no lines. This, however, is due to the way that Hough output is thresholded - the Hough algorithm itself still works well.
Pictures
