Finding lines under bounded error

A new algorithm for finding straight lines in images under a bounded error model is described. The algorithm is based on a hierarchical and adaptive subdivision of the space of line parameters. It measures errors in image space and thereby guarantees that no solution satisfying the given error bound...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition 1996, Vol.29 (1), p.167-178
Main Author: Breuel, Thomas M.
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Bounded error models
Computer science
control theory
systems
Exact sciences and technology
Hough transformation
Object recognition
Parameter space
Pattern recognition. Digital image processing. Computational geometry
Recursive subdivisions
Straight lines
Vision
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new algorithm for finding straight lines in images under a bounded error model is described. The algorithm is based on a hierarchical and adaptive subdivision of the space of line parameters. It measures errors in image space and thereby guarantees that no solution satisfying the given error bounds will be lost. The algorithm can find interpretations of all the lines in the image that satisfy the constraint that each image feature supports at most one line hypothesis. It can be extended to compute efficiently the maxima of the probabilistic Hough transform and the generalized Hough transform under a variety of statistical error models.
ISSN:0031-3203
1873-5142
DOI:10.1016/0031-3203(94)00158-8