{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/total-recall-understanding-traffic-signs","title":"Total Recall: Understanding Traffic Signs using Deep Hierarchical Convolutional Neural Networks","arxiv_id":"1808.10524","date":"2018-08-30","proceeding":null,"authors":["Sourajit Saha","Sharif Amit Kamran","Ali Shihab Sabbir"],"abstract":"Recognizing Traffic Signs using intelligent systems can drastically reduce\nthe number of accidents happening world-wide. With the arrival of Self-driving\ncars it has become a staple challenge to solve the automatic recognition of\nTraffic and Hand-held signs in the major streets. Various machine learning\ntechniques like Random Forest, SVM as well as deep learning models has been\nproposed for classifying traffic signs. Though they reach state-of-the-art\nperformance on a particular data-set, but fall short of tackling multiple\nTraffic Sign Recognition benchmarks. In this paper, we propose a novel and\none-for-all architecture that aces multiple benchmarks with better overall\nscore than the state-of-the-art architectures. Our model is made of residual\nconvolutional blocks with hierarchical dilated skip connections joined in\nsteps. With this we score 99.33% Accuracy in German sign recognition benchmark\nand 99.17% Accuracy in Belgian traffic sign classification benchmark. Moreover,\nwe propose a newly devised dilated residual learning representation technique\nwhich is very low in both memory and computational complexity.","url_abs":"http://arxiv.org/abs/1808.10524v2","url_pdf":"http://arxiv.org/pdf/1808.10524v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"total-recall-understanding-traffic-signs","repo_url":"https://github.com/Sourajit2110/DilatedSkipTotalRecall","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"self-driving-cars","task_name":"Self-Driving Cars"},{"task_slug":"traffic-sign-recognition","task_name":"Traffic Sign Recognition"}],"methods":[{"method_slug":"svm","method_name":"SVM"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Sourajit2110/DilatedSkipTotalRecall","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a9df86df318c3d115bd5d95a1ed88b5e87b731413d0d65b924f7b57bb62d193e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}