{"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/learning-on-the-edge-explicit-boundary","title":"Learning on the Edge: Explicit Boundary Handling in CNNs","arxiv_id":"1805.03106","date":"2018-05-08","proceeding":null,"authors":["Carlo Innamorati","Tobias Ritschel","Tim Weyrich","Niloy J. Mitra"],"abstract":"Convolutional neural networks (CNNs) handle the case where filters extend\nbeyond the image boundary using several heuristics, such as zero, repeat or\nmean padding. These schemes are applied in an ad-hoc fashion and, being weakly\nrelated to the image content and oblivious of the target task, result in low\noutput quality at the boundary. In this paper, we propose a simple and\neffective improvement that learns the boundary handling itself. At\ntraining-time, the network is provided with a separate set of explicit boundary\nfilters. At testing-time, we use these filters which have learned to\nextrapolate features at the boundary in an optimal way for the specific task.\nOur extensive evaluation, over a wide range of architectural changes\n(variations of layers, feature channels, or both), shows how the explicit\nfilters result in improved boundary handling. Consequently, we demonstrate an\nimprovement of 5% to 20% across the board of typical CNN applications\n(colorization, de-Bayering, optical flow, and disparity estimation).","url_abs":"http://arxiv.org/abs/1805.03106v1","url_pdf":"http://arxiv.org/pdf/1805.03106v1.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":"learning-on-the-edge-explicit-boundary","repo_url":"https://github.com/stfc-sciml/differentialconv2d","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"colorization","task_name":"Colorization"},{"task_slug":"disparity-estimation","task_name":"Disparity Estimation"},{"task_slug":"optical-flow-estimation","task_name":"Optical Flow Estimation"}],"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":"stfc-sciml/differentialconv2d","kind":"listed","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":"05be848faf1b666078d6aa7dd5dfb27095eb5fdb7c724405e2acca42880f0e36","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}