Algebraic-distance minimization of lines and ellipses for traffic sign shape localization

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In traffic sign recognition systems, one of the normal approaches is the identification of the shape of the sign prior to the recognition itself. Normally, the recognition process needs an accurate localization of the sign for a good performance. If we are dealing with triangular, rectangular and circular signs, this means the accurate localization of the vertices of the triangle and the rectangle, or the parameters of the ellipse. In this paper we have developed a system which searches the above mentioned parameters from the signature of the blob using techniques of algebraic-distance minimization. Comparisons with previous works show good improvements in the localization of the shape, especially in the presence of slight occlusions. This work is part of a traffic sign recognition system, and in this paper we focus on the shape localization step. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Gil-Jiménez, P., Maldonado-Bascón, S., Gómez-Moreno, H., Lafuente-Arroyo, S., & Acevedo-Rodríguez, J. (2007). Algebraic-distance minimization of lines and ellipses for traffic sign shape localization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4478 LNCS, pp. 540–547). Springer Verlag. https://doi.org/10.1007/978-3-540-72849-8_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free