{"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/boosting-handwriting-text-recognition-in","title":"Boosting Handwriting Text Recognition in Small Databases with Transfer Learning","arxiv_id":"1804.01527","date":"2018-04-04","proceeding":null,"authors":["José Carlos Aradillas","Juan José Murillo-Fuentes","Pablo M. Olmos"],"abstract":"In this paper we deal with the offline handwriting text recognition (HTR)\nproblem with reduced training datasets. Recent HTR solutions based on\nartificial neural networks exhibit remarkable solutions in referenced\ndatabases. These deep learning neural networks are composed of both\nconvolutional (CNN) and long short-term memory recurrent units (LSTM). In\naddition, connectionist temporal classification (CTC) is the key to avoid\nsegmentation at character level, greatly facilitating the labeling task. One of\nthe main drawbacks of the CNNLSTM-CTC (CLC) solutions is that they need a\nconsiderable part of the text to be transcribed for every type of calligraphy,\ntypically in the order of a few thousands of lines. Furthermore, in some\nscenarios the text to transcribe is not that long, e.g. in the Washington\ndatabase. The CLC typically overfits for this reduced number of training\nsamples. Our proposal is based on the transfer learning (TL) from the\nparameters learned with a bigger database. We first investigate, for a reduced\nand fixed number of training samples, 350 lines, how the learning from a large\ndatabase, the IAM, can be transferred to the learning of the CLC of a reduced\ndatabase, Washington. We focus on which layers of the network could be not\nre-trained. We conclude that the best solution is to re-train the whole CLC\nparameters initialized to the values obtained after the training of the CLC\nfrom the larger database. We also investigate results when the training size is\nfurther reduced. The differences in the CER are more remarkable when training\nwith just 350 lines, a CER of 3.3% is achieved with TL while we have a CER of\n18.2% when training from scratch. As a byproduct, the learning times are quite\nreduced. Similar good results are obtained from the Parzival database when\ntrained with this reduced number of lines and this new approach.","url_abs":"http://arxiv.org/abs/1804.01527v1","url_pdf":"http://arxiv.org/pdf/1804.01527v1.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":"boosting-handwriting-text-recognition-in","repo_url":"https://github.com/josarajar/HTRTF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"boosting-handwriting-text-recognition-in","repo_url":"https://github.com/SamuelNguyen1998/Vietnamese_Handwriting_Recognition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"boosting-handwriting-text-recognition-in","repo_url":"https://github.com/huyhoang17/Vietnamese_Handwriting_Recognition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"htr","task_name":"HTR"},{"task_slug":"transfer-learning","task_name":"Transfer Learning"}],"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":"josarajar/HTRTF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"SamuelNguyen1998/Vietnamese_Handwriting_Recognition","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1308.0850"],"harvested_for_calls":[{"arxiv_id":"1308.0850","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1308.0850"},"call":"get_harvested_code_for_paper(arxiv_id=\"1308.0850\")"}]},{"repo":"huyhoang17/Vietnamese_Handwriting_Recognition","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":"d41096f51d24299671ead9f8814195576aaf4ab4f5083c54deb727702ff03a05","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}