{"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/text-perceptron-towards-end-to-end-arbitrary","title":"Text Perceptron: Towards End-to-End Arbitrary-Shaped Text Spotting","arxiv_id":"2002.06820","date":"2020-02-17","proceeding":null,"authors":["Liang Qiao","Sanli Tang","Zhanzhan Cheng","Yunlu Xu","Yi Niu","ShiLiang Pu","Fei Wu"],"abstract":"Many approaches have recently been proposed to detect irregular scene text and achieved promising results. However, their localization results may not well satisfy the following text recognition part mainly because of two reasons: 1) recognizing arbitrary shaped text is still a challenging task, and 2) prevalent non-trainable pipeline strategies between text detection and text recognition will lead to suboptimal performances. To handle this incompatibility problem, in this paper we propose an end-to-end trainable text spotting approach named Text Perceptron. Concretely, Text Perceptron first employs an efficient segmentation-based text detector that learns the latent text reading order and boundary information. Then a novel Shape Transform Module (abbr. STM) is designed to transform the detected feature regions into regular morphologies without extra parameters. It unites text detection and the following recognition part into a whole framework, and helps the whole network achieve global optimization. Experiments show that our method achieves competitive performance on two standard text benchmarks, i.e., ICDAR 2013 and ICDAR 2015, and also obviously outperforms existing methods on irregular text benchmarks SCUT-CTW1500 and Total-Text.","url_abs":"https://arxiv.org/abs/2002.06820v2","url_pdf":"https://arxiv.org/pdf/2002.06820v2.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":"text-perceptron-towards-end-to-end-arbitrary","repo_url":"https://github.com/hikopensource/davar-lab-ocr","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"text-detection","task_name":"Text Detection"},{"task_slug":"text-spotting","task_name":"Text Spotting"},{"task_slug":"global-optimization","task_name":"global-optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/text-spotting-on-icdar-2015","task":"Text Spotting","dataset":"ICDAR 2015","model":"TextPerceptron","rank_in_archive_order":17,"of":18,"metrics":{"F-measure (%) - Generic Lexicon":"65.1","F-measure (%) - Strong Lexicon":"80.5","F-measure (%) - Weak Lexicon":"76.6"},"uses_additional_data":false},{"leaderboard":"/sota/text-spotting-on-scut-ctw1500","task":"Text Spotting","dataset":"SCUT-CTW1500","model":"TextPerceptron","rank_in_archive_order":8,"of":11,"metrics":{"F-measure (%) - No Lexicon":"57.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2002.06820","atlas_url":"https://app.syntology.ai/?focus=2002.06820","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":"2002.06820"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2002.06820\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2002.06820"},"call":"get_concepts_for_paper(arxiv_id=\"2002.06820\")"}],"by_repo":[{"repo":"hikopensource/davar-lab-ocr","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1903.03299"],"harvested_for_calls":[{"arxiv_id":"1903.03299","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1903.03299"},"call":"get_harvested_code_for_paper(arxiv_id=\"1903.03299\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"74cd78812b2fd616737a88f277f02b01ee193f3b92e61c2bc9dd82fc08ef5e66","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}