{"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/confidence-propagation-through-cnns-for","title":"Confidence Propagation through CNNs for Guided Sparse Depth Regression","arxiv_id":"1811.01791","date":"2018-11-05","proceeding":null,"authors":["Abdelrahman Eldesokey","Michael Felsberg","Fahad Shahbaz Khan"],"abstract":"Generally, convolutional neural networks (CNNs) process data on a regular grid, e.g. data generated by ordinary cameras. Designing CNNs for sparse and irregularly spaced input data is still an open research problem with numerous applications in autonomous driving, robotics, and surveillance. In this paper, we propose an algebraically-constrained normalized convolution layer for CNNs with highly sparse input that has a smaller number of network parameters compared to related work. We propose novel strategies for determining the confidence from the convolution operation and propagating it to consecutive layers. We also propose an objective function that simultaneously minimizes the data error while maximizing the output confidence. To integrate structural information, we also investigate fusion strategies to combine depth and RGB information in our normalized convolution network framework. In addition, we introduce the use of output confidence as an auxiliary information to improve the results. The capabilities of our normalized convolution network framework are demonstrated for the problem of scene depth completion. Comprehensive experiments are performed on the KITTI-Depth and the NYU-Depth-v2 datasets. The results clearly demonstrate that the proposed approach achieves superior performance while requiring only about 1-5% of the number of parameters compared to the state-of-the-art methods.","url_abs":"https://arxiv.org/abs/1811.01791v2","url_pdf":"https://arxiv.org/pdf/1811.01791v2.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":"confidence-propagation-through-cnns-for","repo_url":"https://github.com/abdo-eldesokey/nconv","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"autonomous-driving","task_name":"Autonomous Driving"},{"task_slug":"depth-completion","task_name":"Depth Completion"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/depth-completion-on-kitti-depth-completion","task":"Depth Completion","dataset":"KITTI Depth Completion","model":"NConv-CNN-L2","rank_in_archive_order":7,"of":16,"metrics":{"MAE":"233","RMSE":"830","Runtime [ms]":"20"},"uses_additional_data":false},{"leaderboard":"/sota/depth-completion-on-kitti-depth-completion","task":"Depth Completion","dataset":"KITTI Depth Completion","model":"NConv-CNN-L1","rank_in_archive_order":8,"of":16,"metrics":{"MAE":"208","RMSE":"859","Runtime [ms]":"20"},"uses_additional_data":false},{"leaderboard":"/sota/depth-completion-on-kitti-depth-completion","task":"Depth Completion","dataset":"KITTI Depth Completion","model":"NConv-CNN","rank_in_archive_order":15,"of":16,"metrics":{"MAE":"360","RMSE":"1268","Runtime [ms]":"10"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.01791","atlas_url":"https://app.syntology.ai/?focus=1811.01791","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":"1811.01791"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.01791\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.01791"},"call":"get_concepts_for_paper(arxiv_id=\"1811.01791\")"}],"by_repo":[{"repo":"abdo-eldesokey/nconv","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":"507baf8a215334db3f55303b23b2385c3911e6a63dbbcc8cd8ddcac9ff408098","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}