The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Traffic sign classification using K-d trees and Random Forests
Abstract
In this paper, we evaluate the performance of K-d trees and Random Forests for traffic sign classification using different size Histogram of Oriented Gradients (HOG) descriptors and Distance Transforms. We use the German Traffic Sign Benchmark data set [1] containing 43 classes and more than 50,000 images. The K-d tree is fast to build and search in. We combine the tree classifiers with the HOG descriptors as well as the Distance Transforms and achieve classification rates of up to 97% and 81.8% respectively.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Histograms of Oriented Gradients for Human Detection
Dalal, N., & Triggs, B. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.177 · Cited by 33,584
Cited by
Man vs. computer: Benchmarking machine learning algorithms for traffic sign recognition
Stallkamp, J., Schlipsing, M., Salmen, J., & Igel, C. (2012) · Neural Networks · doi:10.1016/j.neunet.2012.02.016 · Cited by 1,537
Mogelmose, A., Trivedi, M. M., & Moeslund, T. B. (2012) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2012.2209421 · Cited by 684
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
Enhancing transportation systems via deep learning: A survey
Wang, Y., Zhang, D., Liu, Y., Dai, B., & Lee, L. H. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.12.004 · Cited by 312
Traffic Sign Recognition With Hinge Loss Trained Convolutional Neural Networks
Jin, J., Fu, K., & Zhang, C. (2014) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2014.2308281 · Cited by 310
Metadata
- Authors
- Zaklouta, F., Stanciulescu, B., & Hamdoun, O.
- Venue
- The 2011 International Joint Conference on Neural Networks
- Publisher
- IEEE
- Published
- 2011-07
- Pages
- 2151-2155
- ISSN
- 2161-4407 (ISSN-L)
- OpenAlex
- W2100925315
- Cited by
- 161
- References
- 2
- FWCI
- 6.22
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Traffic sign classification using K-d trees and Random Forests. https://app.cochat.ai/papers/10.1109/ijcnn.2011.6033494
- The paper
- Zaklouta, F., Stanciulescu, B., & Hamdoun, O. (2011). Traffic sign classification using K-d trees and Random Forests. The 2011 International Joint Conference on Neural Networks. https://doi.org/10.1109/ijcnn.2011.6033494
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.