The Hough Transform without the Accumulators

Authors:
Atsushi Imiya;Tetsu Hada;Ken Tatara
Affiliations:
-;-;-
Venue:
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2002

Citing 5
Cited 1

Which Hough transform?

CVGIP: Image Understanding
Semidefinite programming

SIAM Review
Computer Vision

Computer Vision
Fast Line Detection Algorithms Based on Combinatorial Optimization

IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

A robust and accumulator-free ellipse hough transform

Proceedings of the 12th annual ACM international conference on Multimedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

The least-squares method (LSM) efficiently solves the model-fitting problem, if we assume a model equation. For the fitting to a collection of models, the classification of data is required as pre-processing. The Hough transform, achieves both the classification of sample points and the model fitting concurrently. However, as far as adopting the voting process is concerned, the maintenance of the accumulator during the computation cannot be neglected. We propose a Hough transform without the accumulator expressing the classification of data for the model fitting problems as the permutation of matrices which are defined by data.