{"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/fast-deep-stereo-with-2d-convolutional","title":"Fast Deep Stereo with 2D Convolutional Processing of Cost Signatures","arxiv_id":"1903.04939","date":"2019-03-08","proceeding":null,"authors":["Kyle Yee","Ayan Chakrabarti"],"abstract":"Modern neural network-based algorithms are able to produce highly accurate\ndepth estimates from stereo image pairs, nearly matching the reliability of\nmeasurements from more expensive depth sensors. However, this accuracy comes\nwith a higher computational cost since these methods use network architectures\ndesigned to compute and process matching scores across all candidate matches at\nall locations, with floating point computations repeated across a match volume\nwith dimensions corresponding to both space and disparity. This leads to longer\nrunning times to process each image pair, making them impractical for real-time\nuse in robots and autonomous vehicles. We propose a new stereo algorithm that\nemploys a significantly more efficient network architecture. Our method builds\nan initial match cost volume using traditional matching costs that are fast to\ncompute, and trains a network to estimate disparity from this volume.\nCrucially, our network only employs per-pixel and two-dimensional convolution\noperations: to summarize the match information at each location as a\nlow-dimensional feature vector, and to spatially process these `cost-signature'\nfeatures to produce a dense disparity map. Experimental results on the KITTI\nbenchmark show that our method delivers competitive accuracy at significantly\nhigher speeds---running at 48 frames per second on a modern GPU.","url_abs":"http://arxiv.org/abs/1903.04939v1","url_pdf":"http://arxiv.org/pdf/1903.04939v1.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":"fast-deep-stereo-with-2d-convolutional","repo_url":"https://github.com/ayanc/fdscs","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"autonomous-vehicles","task_name":"Autonomous Vehicles"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.04939","atlas_url":"https://app.syntology.ai/?focus=1903.04939","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":"1903.04939"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.04939\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.04939"},"call":"get_concepts_for_paper(arxiv_id=\"1903.04939\")"}],"by_repo":[{"repo":"ayanc/fdscs","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":"9edd4105ef327e468f667e7a68b4dbe15538823d5759a57b443900be4a0ac7fd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}