The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Goal Evaluation of Segmentation Algorithms for Traffic Sign Recognition
Abstract
This paper presents a quantitative comparison of several segmentation methods (including new ones) that have successfully been used in traffic sign recognition. The methods presented can be classified into color-space thresholding, edge detection, and chromatic/achromatic decomposition. Our support vector machine (SVM) segmentation method and speed enhancement using a lookup table (LUT) have also been tested. The best algorithm will be the one that yields the best global results throughout the whole recognition process, which comprises three stages: 1) segmentation; 2) detection; and 3) recognition. Thus, an evaluation method, which consists of applying the entire recognition system to a set of images with at least one traffic sign, is attempted while changing the segmentation method used. This way, it is possible to observe modifications in performance due to the kind of segmentation used. The results lead us to conclude that the best methods are those that are normalized with respect to illumination, such as RGB or Ohta Normalized, and there is no improvement in the use of Hue Saturation Intensity (HSI)-like spaces. In addition, an LUT with a reduction in the less-significant bits, such as that proposed here, improves speed while maintaining quality. SVMs used in color segmentation give good results, but some improvements are needed when applied to achromatic colors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Cited by
Data-Driven Intelligent Transportation Systems: A Survey
Zhang, J., Wang, F.-Y., Wang, K., Lin, W.-H., Xu, X., & Chen, C. (2011) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2011.2158001 · Cited by 1,817
“[46] have evaluated the influence of image segmentation algorithms for traffic sign recognition.”
BackgroundMogelmose, A., Trivedi, M. M., & Moeslund, T. B. (2012) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2012.2209421 · Cited by 684
Overview of Environment Perception for Intelligent Vehicles
Zhu, H., Yuen, K.-V., Mihaylova, L., & Leung, H. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2017.2658662 · Cited by 386
Towards Real-Time Traffic Sign Detection and Classification
Yang, Y., Luo, H., Xu, H., & Wu, F. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2482461 · Cited by 321
Yolo-Based Traffic Sign Recognition Algorithm
Li, M., Zhang, L., Li, L., & Song, W. (2022) · Computational Intelligence and Neuroscience · doi:10.1155/2022/2682921 · Cited by 17
Retracted
Metadata
- Authors
- Gomez-Moreno, H., Maldonado-Bascon, S., Gil-Jimenez, P., & Lafuente-Arroyo, S.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2010-12
- Volume
- 11
- Issue
- 4
- Pages
- 917-930
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2136094925
- Cited by
- 210
- References
- 2
- FWCI
- 28.84
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.