{"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/joint-learning-of-blind-super-resolution-and","title":"Joint Learning of Blind Super-Resolution and Crack Segmentation for Realistic Degraded Images","arxiv_id":"2302.12491","date":"2023-02-24","proceeding":"IEEE Transactions on Instrumentation and Measurement (TIM) 2024 3","authors":["Yuki Kondo","Norimichi Ukita"],"abstract":"This paper proposes crack segmentation augmented by super resolution (SR) with deep neural networks. In the proposed method, a SR network is jointly trained with a binary segmentation network in an end-to-end manner. This joint learning allows the SR network to be optimized for improving segmentation results. For realistic scenarios, the SR network is extended from non-blind to blind for processing a low-resolution image degraded by unknown blurs. The joint network is improved by our proposed two extra paths that further encourage the mutual optimization between SR and segmentation. Comparative experiments with State of The Art (SoTA) segmentation methods demonstrate the superiority of our joint learning, and various ablation studies prove the effects of our contributions.","url_abs":"https://arxiv.org/abs/2302.12491v3","url_pdf":"https://arxiv.org/pdf/2302.12491v3.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":"joint-learning-of-blind-super-resolution-and","repo_url":"https://github.com/yuki-11/csbsr","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"blind-super-resolution","task_name":"Blind Super-Resolution"},{"task_slug":"crack-segmentation","task_name":"Crack Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"super-resolution","task_name":"Super-Resolution"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/crack-segmentation-on-khanhha-s-dataset-4x-1","task":"Crack Segmentation","dataset":"khanhha's dataset - 4x upscaling (blind)","model":"CSBSR (w/ PSPNet)","rank_in_archive_order":1,"of":7,"metrics":{"AHD95":"22.52","Average IOU":"0.552","HD95_min":"20.92","IoU_max":"0.573"},"uses_additional_data":true},{"leaderboard":"/sota/crack-segmentation-on-khanhha-s-dataset-4x-1","task":"Crack Segmentation","dataset":"khanhha's dataset - 4x upscaling (blind)","model":"CSBSR (w/ PSPNet+FOW)","rank_in_archive_order":2,"of":7,"metrics":{"AHD95":"21.70","Average IOU":"0.551","HD95_min":"18.73","IoU_max":"0.573"},"uses_additional_data":true},{"leaderboard":"/sota/crack-segmentation-on-khanhha-s-dataset-4x-1","task":"Crack Segmentation","dataset":"khanhha's dataset - 4x upscaling (blind)","model":"CSBSR (w/ HRNet+OCR)","rank_in_archive_order":4,"of":7,"metrics":{"AHD95":"20.29","Average IOU":"0.534","HD95_min":"17.54","IoU_max":"0.553"},"uses_additional_data":true},{"leaderboard":"/sota/crack-segmentation-on-khanhha-s-dataset-4x-1","task":"Crack Segmentation","dataset":"khanhha's dataset - 4x upscaling (blind)","model":"CSBSR (w/ PSPNet+FOW+BlurSkip)","rank_in_archive_order":5,"of":7,"metrics":{"AHD95":"19.10","Average IOU":"0.528","HD95_min":"18.06","IoU_max":"0.550"},"uses_additional_data":true}],"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":"yuki-11/csbsr","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":"2b3eefa8828947d16c1fe4dd70b0d326ca671a48a7b43665498cabb0becd645d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}