{"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/depth-estimation-via-affinity-learned-with","title":"Depth Estimation via Affinity Learned with Convolutional Spatial Propagation Network","arxiv_id":"1808.00150","date":"2018-08-01","proceeding":"ECCV 2018 9","authors":["Xinjing Cheng","Peng Wang","Ruigang Yang"],"abstract":"Depth estimation from a single image is a fundamental problem in computer\nvision. In this paper, we propose a simple yet effective convolutional spatial\npropagation network (CSPN) to learn the affinity matrix for depth prediction.\nSpecifically, we adopt an efficient linear propagation model, where the\npropagation is performed with a manner of recurrent convolutional operation,\nand the affinity among neighboring pixels is learned through a deep\nconvolutional neural network (CNN). We apply the designed CSPN to two depth\nestimation tasks given a single image: (1) To refine the depth output from\nstate-of-the-art (SOTA) existing methods; and (2) to convert sparse depth\nsamples to a dense depth map by embedding the depth samples within the\npropagation procedure. The second task is inspired by the availability of\nLIDARs that provides sparse but accurate depth measurements. We experimented\nthe proposed CSPN over two popular benchmarks for depth estimation, i.e. NYU v2\nand KITTI, where we show that our proposed approach improves in not only\nquality (e.g., 30% more reduction in depth error), but also speed (e.g., 2 to 5\ntimes faster) than prior SOTA methods.","url_abs":"http://arxiv.org/abs/1808.00150v1","url_pdf":"http://arxiv.org/pdf/1808.00150v1.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":"depth-estimation-via-affinity-learned-with","repo_url":"https://github.com/XinJCheng/CSPN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"depth-estimation","task_name":"Depth Estimation"},{"task_slug":"depth-prediction","task_name":"Depth Prediction"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.00150","atlas_url":"https://app.syntology.ai/?focus=1808.00150","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":"1808.00150"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.00150\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.00150"},"call":"get_concepts_for_paper(arxiv_id=\"1808.00150\")"}],"by_repo":[{"repo":"XinJCheng/CSPN","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":"62a2045d5af98a3657ed569eecc7a247076a64bfdc1a104bc88ef60852b18836","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}