{"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/accurate-data-efficient-unconstrained-text","title":"Accurate, Data-Efficient, Unconstrained Text Recognition with Convolutional Neural Networks","arxiv_id":"1812.11894","date":"2018-12-31","proceeding":null,"authors":["Mohamed Yousef","Khaled F. Hussain","Usama S. Mohammed"],"abstract":"Unconstrained text recognition is an important computer vision task,\nfeaturing a wide variety of different sub-tasks, each with its own set of\nchallenges. One of the biggest promises of deep neural networks has been the\nconvergence and automation of feature extractors from input raw signals,\nallowing for the highest possible performance with minimum required domain\nknowledge. To this end, we propose a data-efficient, end-to-end neural network\nmodel for generic, unconstrained text recognition. In our proposed architecture\nwe strive for simplicity and efficiency without sacrificing recognition\naccuracy. Our proposed architecture is a fully convolutional network without\nany recurrent connections trained with the CTC loss function. Thus it operates\non arbitrary input sizes and produces strings of arbitrary length in a very\nefficient and parallelizable manner. We show the generality and superiority of\nour proposed text recognition architecture by achieving state of the art\nresults on seven public benchmark datasets, covering a wide spectrum of text\nrecognition tasks, namely: Handwriting Recognition, CAPTCHA recognition, OCR,\nLicense Plate Recognition, and Scene Text Recognition. Our proposed\narchitecture has won the ICFHR2018 Competition on Automated Text Recognition on\na READ Dataset.","url_abs":"http://arxiv.org/abs/1812.11894v1","url_pdf":"http://arxiv.org/pdf/1812.11894v1.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":"accurate-data-efficient-unconstrained-text","repo_url":"https://github.com/IntuitionMachines/OrigamiNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"handwriting-recognition","task_name":"Handwriting Recognition"},{"task_slug":"license-plate-recognition","task_name":"License Plate Recognition"},{"task_slug":"optical-character-recognition","task_name":"Optical Character Recognition (OCR)"},{"task_slug":"scene-text-recognition","task_name":"Scene Text Recognition"}],"methods":[{"method_slug":"ctc-loss","method_name":"CTC Loss"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.11894","atlas_url":"https://app.syntology.ai/?focus=1812.11894","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1812.11894"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.11894\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.11894"},"call":"get_concepts_for_paper(arxiv_id=\"1812.11894\")"}],"by_repo":[{"repo":"IntuitionMachines/OrigamiNet","kind":"listed","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":"8dcd8130a639233fcfd8155ea037d052770201aa71d54efd84f9c2867af1387e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}