{"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/semi-supervised-and-task-driven-data","title":"Semi-Supervised and Task-Driven Data Augmentation","arxiv_id":"1902.05396","date":"2019-02-11","proceeding":null,"authors":["Krishna Chaitanya","Neerav Karani","Christian Baumgartner","Olivio Donati","Anton Becker","Ender Konukoglu"],"abstract":"Supervised deep learning methods for segmentation require large amounts of\nlabelled training data, without which they are prone to overfitting, not\ngeneralizing well to unseen images. In practice, obtaining a large number of\nannotations from clinical experts is expensive and time-consuming. One way to\naddress scarcity of annotated examples is data augmentation using random\nspatial and intensity transformations. Recently, it has been proposed to use\ngenerative models to synthesize realistic training examples, complementing the\nrandom augmentation. So far, these methods have yielded limited gains over the\nrandom augmentation. However, there is potential to improve the approach by (i)\nexplicitly modeling deformation fields (non-affine spatial transformation) and\nintensity transformations and (ii) leveraging unlabelled data during the\ngenerative process. With this motivation, we propose a novel task-driven data\naugmentation method where to synthesize new training examples, a generative\nnetwork explicitly models and applies deformation fields and additive intensity\nmasks on existing labelled data, modeling shape and intensity variations,\nrespectively. Crucially, the generative model is optimized to be conducive to\nthe task, in this case segmentation, and constrained to match the distribution\nof images observed from labelled and unlabelled samples. Furthermore, explicit\nmodeling of deformation fields allow synthesizing segmentation masks and images\nin exact correspondence by simply applying the generated transformation to an\ninput image and the corresponding annotation. Our experiments on cardiac\nmagnetic resonance images (MRI) showed that, for the task of segmentation in\nsmall training data scenarios, the proposed method substantially outperforms\nconventional augmentation techniques.","url_abs":"http://arxiv.org/abs/1902.05396v2","url_pdf":"http://arxiv.org/pdf/1902.05396v2.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":"semi-supervised-and-task-driven-data","repo_url":"https://github.com/krishnabits001/task_driven_data_augmentation","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}}],"tasks":[{"task_slug":"data-augmentation","task_name":"Data Augmentation"},{"task_slug":"segmentation","task_name":"Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.05396","atlas_url":"https://app.syntology.ai/?focus=1902.05396","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":"1902.05396"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.05396\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.05396"},"call":"get_concepts_for_paper(arxiv_id=\"1902.05396\")"}],"by_repo":[{"repo":"krishnabits001/task_driven_data_augmentation","kind":"official","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":"55071a2f08eb9f50bf0a9f76728f448bce720f3e0e4c29ce059b7cdb72a01fbf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}