{"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/henet-forcing-a-network-to-think-more-for","title":"HENet: Forcing a Network to Think More for Font Recognition","arxiv_id":"2110.10872","date":"2021-10-21","proceeding":null,"authors":["Jingchao Chen","Shiyi Mu","Shugong Xu","Youdong Ding"],"abstract":"Although lots of progress were made in Text Recognition/OCR in recent years, the task of font recognition is remaining challenging. The main challenge lies in the subtle difference between these similar fonts, which is hard to distinguish. This paper proposes a novel font recognizer with a pluggable module solving the font recognition task. The pluggable module hides the most discriminative accessible features and forces the network to consider other complicated features to solve the hard examples of similar fonts, called HE Block. Compared with the available public font recognition systems, our proposed method does not require any interactions at the inference stage. Extensive experiments demonstrate that HENet achieves encouraging performance, including on character-level dataset Explor_all and word-level dataset AdobeVFR","url_abs":"https://arxiv.org/abs/2110.10872v1","url_pdf":"https://arxiv.org/pdf/2110.10872v1.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":"henet-forcing-a-network-to-think-more-for","repo_url":"https://github.com/PhamQuocHuy1101/transfer-learning-template/blob/master/network/henet.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"font-recognition","task_name":"Font Recognition"},{"task_slug":"optical-character-recognition","task_name":"Optical Character Recognition (OCR)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/font-recognition-on-adobevfr-real","task":"Font Recognition","dataset":"AdobeVFR real","model":"HENet (ResNet18+HE Block)","rank_in_archive_order":2,"of":2,"metrics":{"Top 1 Accuracy":"47.41","Top 5 Accuracy":"65.11"},"uses_additional_data":false},{"leaderboard":"/sota/font-recognition-on-adobevfr-syn","task":"Font Recognition","dataset":"AdobeVFR syn","model":"HENet (ResNet18+HE Block)","rank_in_archive_order":2,"of":5,"metrics":{"Top 1 Accuracy":"98.23","Top 5 Accuracy":"99.98"},"uses_additional_data":false},{"leaderboard":"/sota/font-recognition-on-explor-all","task":"Font Recognition","dataset":"Explor_all","model":"HENet","rank_in_archive_order":1,"of":1,"metrics":{"Top 1 Accuracy":"86.31","Top 5 Accuracy":"98.48"},"uses_additional_data":false}],"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":"PhamQuocHuy1101/transfer-learning-template","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":"af5855937ebc9606b297411a9475884eb59b5301bf0f55065432dfe16fb1d326","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}