{"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/sparsity-invariant-cnns","title":"Sparsity Invariant CNNs","arxiv_id":"1708.06500","date":"2017-08-22","proceeding":null,"authors":["Jonas Uhrig","Nick Schneider","Lukas Schneider","Uwe Franke","Thomas Brox","Andreas Geiger"],"abstract":"In this paper, we consider convolutional neural networks operating on sparse\ninputs with an application to depth upsampling from sparse laser scan data.\nFirst, we show that traditional convolutional networks perform poorly when\napplied to sparse data even when the location of missing data is provided to\nthe network. To overcome this problem, we propose a simple yet effective sparse\nconvolution layer which explicitly considers the location of missing data\nduring the convolution operation. We demonstrate the benefits of the proposed\nnetwork architecture in synthetic and real experiments with respect to various\nbaseline approaches. Compared to dense baselines, the proposed sparse\nconvolution network generalizes well to novel datasets and is invariant to the\nlevel of sparsity in the data. For our evaluation, we derive a novel dataset\nfrom the KITTI benchmark, comprising 93k depth annotated RGB images. Our\ndataset allows for training and evaluating depth upsampling and depth\nprediction techniques in challenging real-world settings and will be made\navailable upon publication.","url_abs":"http://arxiv.org/abs/1708.06500v2","url_pdf":"http://arxiv.org/pdf/1708.06500v2.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":"sparsity-invariant-cnns","repo_url":"https://github.com/PeterTor/sparse_convolution","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"depth-completion","task_name":"Depth Completion"},{"task_slug":"depth-estimation","task_name":"Depth Estimation"},{"task_slug":"depth-prediction","task_name":"Depth Prediction"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[{"slug":"kitti-depth","name":"KITTI-Depth","full_name":null}],"methods_introduced":[],"results":[{"leaderboard":"/sota/depth-completion-on-kitti-depth-completion","task":"Depth Completion","dataset":"KITTI Depth Completion","model":"SparseConvs","rank_in_archive_order":16,"of":16,"metrics":{"MAE":"481","RMSE":"1601","Runtime [ms]":"10"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.06500","atlas_url":"https://app.syntology.ai/?focus=1708.06500","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":"1708.06500"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.06500\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.06500"},"call":"get_concepts_for_paper(arxiv_id=\"1708.06500\")"}],"by_repo":[{"repo":"PeterTor/sparse_convolution","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":"db9b6c6b8e9901ec87e525ccd22b84f6b70a6478165fb4650dbb6719d6f1ae04","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}