A fast Raffic sign recognition algorithm for gray value images

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

Abstract

A fast shape recognition method is presented for detecting traffic signs in monochrome images. Based on Marr’s primal sketch we used a hierarchical grouping method to link low-level features of pixels like gradient orientations to high-level features like triangles and ellipses. The method is fast, because it is based on local pixel operations instead of analyzing the whole shape. Examining the local area around a pixel for parts of geometrical shapes, results are symbolic representation which are linked back to the pixel, i.e. the pixel is part of the geometrical shape. A unique description of the geometrical shape is calculated from pixels lying on the shape.

Cite

CITATION STYLE

APA

Schiekel, C. (1999). A fast Raffic sign recognition algorithm for gray value images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1689, pp. 588–595). Springer Verlag. https://doi.org/10.1007/3-540-48375-6_70

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