Dynamically quantized spaces for focusing the Hough Transform

Authors:
Joseph O'Rourke
Affiliations:
Electrical Engineering Department, Johns Hopkins University, Baltimore, MD
Venue:
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Year:
1981

Citing 7
Cited 3

An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Finding circles by an array of accumulators

Communications of the ACM
Multidimensional binary search trees used for associative searching

Communications of the ACM
Use of the Hough transformation to detect lines and curves in pictures

Communications of the ACM
Digital Picture Processing

Digital Picture Processing
Hough transform theory and image processing experiments.

Hough transform theory and image processing experiments.
Multidimensional Binary Search Trees in Database Applications

IEEE Transactions on Software Engineering

An improved Hough transform neighborhood map for straight line segments

IEEE Transactions on Image Processing
Real-time line detection using accelerated high-resolution Hough transform

SCIA'11 Proceedings of the 17th Scandinavian conference on Image analysis
Real-time detection of lines using parallel coordinates and CUDA

Journal of Real-Time Image Processing

Quantified Score

Hi-index	0.01

Visualization

Abstract

A dynamic data structure is suggested for representing the accumulator array used with a Hough Transform. The structure, called a Dynamically Quantlsd Space, allocates resources where they are most needed to best discriminate the peak in the parameter space. The effect is to focus the Hough Transform. Such attention control is especially needed when the parameter space has a large number of dimensions.