Treffer: The Hough transform without the accumulators

Title:
The Hough transform without the accumulators
Source:
Structural, syntactic, and statistical pattern recognition (Windsor ON, 6-9 August 2002)Lecture notes in computer science. :823-832
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 10 ref
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo 101-8430, Japan
IMIT, Chiba University, 1-33 Yayoi-cho, Inage-ku, 263-8522, Chiba, Japan
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14614417
Database:
PASCAL Archive

Weitere Informationen

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.