{"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/icdar-2024-competition-on-few-shot-and-many","title":"ICDAR 2024 Competition on Few-Shot and Many-Shot Layout Segmentation of Ancient Manuscripts (SAM)","arxiv_id":null,"date":"2024-09-11","proceeding":"International Conference on Document Analysis and Recognition (ICDAR) 2024 9","authors":["Silvia Zottin","Axel De Nardin","Gian Luca Foresti","Emanuela Colombi","Claudio Piciarelli"],"abstract":"Layout analysis is a critical aspect of Document Image Analysis, particularly when it comes to ancient manuscripts. It serves as a foundational step in streamlining subsequent tasks such as optical character recognition and automated transcription. However, one key challenge in this context is represented by the lack of available ground truths as they are extremely time-consuming to produce. Nevertheless, numerous approaches addressing this challenge heavily lean towards a fully supervised learning paradigm, which represents a rare scenario in a real-world setting. For this reason, with this competition, we propose the challenge of addressing this task with a few-shot learning approach, involving the use of only three images for training. The competition dataset, called U-DIADS-Bib, comprises four distinct ancient manuscripts, presenting heterogeneous layout structures, levels of degradation, and languages used. This diversity adds intrigue and complexity to the challenge. In addition, we have also allowed participating in the competition with traditional many-shot learning approaches, for which the whole training set of U-DIADS-Bib was made available.","url_abs":"https://link.springer.com/chapter/10.1007/978-3-031-70552-6_19","url_pdf":"https://link.springer.com/chapter/10.1007/978-3-031-70552-6_19","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":[],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"document-layout-analysis","task_name":"Document Layout Analysis"},{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"optical-character-recognition","task_name":"Optical Character Recognition"}],"methods":[{"method_slug":"set","method_name":"SET"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/document-layout-analysis-on-u-diads-bib","task":"Document Layout Analysis","dataset":"U-DIADS-Bib","model":"CV-Group","rank_in_archive_order":1,"of":5,"metrics":{"Class Average IoU":"83.40","Class Average IoU (Few-shot setting)":"78.40"},"uses_additional_data":false},{"leaderboard":"/sota/document-layout-analysis-on-u-diads-bib","task":"Document Layout Analysis","dataset":"U-DIADS-Bib","model":"CNKI","rank_in_archive_order":2,"of":5,"metrics":{"Class Average IoU":"77.80","Class Average IoU (Few-shot setting)":"65.90"},"uses_additional_data":false},{"leaderboard":"/sota/document-layout-analysis-on-u-diads-bib","task":"Document Layout Analysis","dataset":"U-DIADS-Bib","model":"VAI-OCR","rank_in_archive_order":3,"of":5,"metrics":{"Class Average IoU":"70.70","Class Average IoU (Few-shot setting)":"70.00"},"uses_additional_data":false},{"leaderboard":"/sota/document-layout-analysis-on-u-diads-bib","task":"Document Layout Analysis","dataset":"U-DIADS-Bib","model":"L3i++","rank_in_archive_order":5,"of":5,"metrics":{"Class Average IoU (Few-shot setting)":"61.10"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"96140f7de7b8000e134da1fda19e2156b49a1a4fac5b50af2cddbc9960260ccf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}