{"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/read-bad-a-new-dataset-and-evaluation-scheme","title":"READ-BAD: A New Dataset and Evaluation Scheme for Baseline Detection in Archival Documents","arxiv_id":"1705.03311","date":"2017-05-09","proceeding":null,"authors":["Tobias Grüning","Roger Labahn","Markus Diem","Florian Kleber","Stefan Fiel"],"abstract":"Text line detection is crucial for any application associated with Automatic\nText Recognition or Keyword Spotting. Modern algorithms perform good on\nwell-established datasets since they either comprise clean data or\nsimple/homogeneous page layouts. We have collected and annotated 2036 archival\ndocument images from different locations and time periods. The dataset contains\nvarying page layouts and degradations that challenge text line segmentation\nmethods. Well established text line segmentation evaluation schemes such as the\nDetection Rate or Recognition Accuracy demand for binarized data that is\nannotated on a pixel level. Producing ground truth by these means is laborious\nand not needed to determine a method's quality. In this paper we propose a new\nevaluation scheme that is based on baselines. The proposed scheme has no need\nfor binarization and it can handle skewed as well as rotated text lines. The\nICDAR 2017 Competition on Baseline Detection and the ICDAR 2017 Competition on\nLayout Analysis for Challenging Medieval Manuscripts used this evaluation\nscheme. Finally, we present results achieved by a recently published text line\ndetection algorithm.","url_abs":"http://arxiv.org/abs/1705.03311v2","url_pdf":"http://arxiv.org/pdf/1705.03311v2.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":"read-bad-a-new-dataset-and-evaluation-scheme","repo_url":"https://github.com/Transkribus/TranskribusBaseLineEvaluationScheme","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"read-bad-a-new-dataset-and-evaluation-scheme","repo_url":"https://github.com/TobiasGruening/ARU-Net","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"read-bad-a-new-dataset-and-evaluation-scheme","repo_url":"https://github.com/dhlab-epfl/dhSegment","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"read-bad-a-new-dataset-and-evaluation-scheme","repo_url":"https://github.com/imagine5am/ARU-Net","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"binarization","task_name":"Binarization"},{"task_slug":"keyword-spotting","task_name":"Keyword Spotting"},{"task_slug":"line-detection","task_name":"Line Detection"}],"methods":[],"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":"Transkribus/TranskribusBaseLineEvaluationScheme","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TobiasGruening/ARU-Net","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1505.04597"],"harvested_for_calls":[{"arxiv_id":"1505.04597","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1505.04597"},"call":"get_harvested_code_for_paper(arxiv_id=\"1505.04597\")"}]},{"repo":"dhlab-epfl/dhSegment","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"imagine5am/ARU-Net","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"187928ede796a79ce155fc4dd065015c47ae9fde69800d4828e13f82a8e98312","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}