{"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/in-defense-of-classical-image-processing-fast","title":"In Defense of Classical Image Processing: Fast Depth Completion on the CPU","arxiv_id":"1802.00036","date":"2018-01-31","proceeding":null,"authors":["Jason Ku","Ali Harakeh","Steven L. Waslander"],"abstract":"With the rise of data driven deep neural networks as a realization of\nuniversal function approximators, most research on computer vision problems has\nmoved away from hand crafted classical image processing algorithms. This paper\nshows that with a well designed algorithm, we are capable of outperforming\nneural network based methods on the task of depth completion. The proposed\nalgorithm is simple and fast, runs on the CPU, and relies only on basic image\nprocessing operations to perform depth completion of sparse LIDAR depth data.\nWe evaluate our algorithm on the challenging KITTI depth completion benchmark,\nand at the time of submission, our method ranks first on the KITTI test server\namong all published methods. Furthermore, our algorithm is data independent,\nrequiring no training data to perform the task at hand. The code written in\nPython will be made publicly available at https://github.com/kujason/ip_basic.","url_abs":"http://arxiv.org/abs/1802.00036v1","url_pdf":"http://arxiv.org/pdf/1802.00036v1.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":"in-defense-of-classical-image-processing-fast","repo_url":"https://github.com/kujason/ip_basic","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"in-defense-of-classical-image-processing-fast","repo_url":"https://github.com/sabadijou/FastDepthCompletionCPU","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":null,"task_name":"CPU"},{"task_slug":"depth-completion","task_name":"Depth Completion"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.00036","atlas_url":"https://app.syntology.ai/?focus=1802.00036","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":"1802.00036"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.00036\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.00036"},"call":"get_concepts_for_paper(arxiv_id=\"1802.00036\")"}],"by_repo":[{"repo":"kujason/ip_basic","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sabadijou/FastDepthCompletionCPU","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":"8b0a0d73152252348999ba355c977fd987b1f3add3efd8e33e4797f0e4dbddb8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}