{"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-deep-structured-active-contours-end","title":"Learning deep structured active contours end-to-end","arxiv_id":"1803.06329","date":"2018-03-16","proceeding":"CVPR 2018 6","authors":["Diego Marcos","Devis Tuia","Benjamin Kellenberger","Lisa Zhang","Min Bai","Renjie Liao","Raquel Urtasun"],"abstract":"The world is covered with millions of buildings, and precisely knowing each\ninstance's position and extents is vital to a multitude of applications.\nRecently, automated building footprint segmentation models have shown superior\ndetection accuracy thanks to the usage of Convolutional Neural Networks (CNN).\nHowever, even the latest evolutions struggle to precisely delineating borders,\nwhich often leads to geometric distortions and inadvertent fusion of adjacent\nbuilding instances. We propose to overcome this issue by exploiting the\ndistinct geometric properties of buildings. To this end, we present Deep\nStructured Active Contours (DSAC), a novel framework that integrates priors and\nconstraints into the segmentation process, such as continuous boundaries,\nsmooth edges, and sharp corners. To do so, DSAC employs Active Contour Models\n(ACM), a family of constraint- and prior-based polygonal models. We learn ACM\nparameterizations per instance using a CNN, and show how to incorporate all\ncomponents in a structured output model, making DSAC trainable end-to-end. We\nevaluate DSAC on three challenging building instance segmentation datasets,\nwhere it compares favorably against state-of-the-art. Code will be made\navailable.","url_abs":"http://arxiv.org/abs/1803.06329v1","url_pdf":"http://arxiv.org/pdf/1803.06329v1.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-deep-structured-active-contours-end","repo_url":"https://github.com/dmarcosg/DSAC","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"learning-deep-structured-active-contours-end","repo_url":"https://github.com/tweedlemoon/DSAC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"instance-segmentation","task_name":"Instance Segmentation"},{"task_slug":"segmentation","task_name":"Segmentation"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.06329","atlas_url":"https://app.syntology.ai/?focus=1803.06329","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":"1803.06329"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.06329\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.06329"},"call":"get_concepts_for_paper(arxiv_id=\"1803.06329\")"}],"by_repo":[{"repo":"dmarcosg/DSAC","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tweedlemoon/DSAC","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":"4d4f61613297c4b63a8ebf12c378d2010419197f0b3614b1b76c555a01e89401","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}