{"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-robust-monocular-depth-estimation-for","title":"Fast Robust Monocular Depth Estimation for Obstacle Detection with Fully Convolutional Networks","arxiv_id":"1607.06349","date":"2016-07-21","proceeding":null,"authors":["Michele Mancini","Gabriele Costante","Paolo Valigi","Thomas A. Ciarfuglia"],"abstract":"Obstacle Detection is a central problem for any robotic system, and critical\nfor autonomous systems that travel at high speeds in unpredictable environment.\nThis is often achieved through scene depth estimation, by various means. When\nfast motion is considered, the detection range must be longer enough to allow\nfor safe avoidance and path planning. Current solutions often make assumption\non the motion of the vehicle that limit their applicability, or work at very\nlimited ranges due to intrinsic constraints. We propose a novel\nappearance-based Object Detection system that is able to detect obstacles at\nvery long range and at a very high speed (~300Hz), without making assumptions\non the type of motion. We achieve these results using a Deep Neural Network\napproach trained on real and synthetic images and trading some depth accuracy\nfor fast, robust and consistent operation. We show how photo-realistic\nsynthetic images are able to solve the problem of training set dimension and\nvariety typical of machine learning approaches, and how our system is robust to\nmassive blurring of test images.","url_abs":"http://arxiv.org/abs/1607.06349v1","url_pdf":"http://arxiv.org/pdf/1607.06349v1.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-robust-monocular-depth-estimation-for","repo_url":"https://github.com/EbadSyed/spadRGBD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"fast-robust-monocular-depth-estimation-for","repo_url":"https://github.com/LeonSun0101/CD-SD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"fast-robust-monocular-depth-estimation-for","repo_url":"https://github.com/fangchangma/sparse-to-dense.pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"fast-robust-monocular-depth-estimation-for","repo_url":"https://github.com/katieluo88/280finalproj_nyudepth","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"depth-estimation","task_name":"Depth Estimation"},{"task_slug":"monocular-depth-estimation","task_name":"Monocular Depth Estimation"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1607.06349","atlas_url":"https://app.syntology.ai/?focus=1607.06349","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":"1607.06349"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1607.06349\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1607.06349"},"call":"get_concepts_for_paper(arxiv_id=\"1607.06349\")"}],"by_repo":[{"repo":"EbadSyed/spadRGBD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"LeonSun0101/CD-SD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"fangchangma/sparse-to-dense.pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1709.07492"],"harvested_for_calls":[{"arxiv_id":"1709.07492","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1709.07492"},"call":"get_harvested_code_for_paper(arxiv_id=\"1709.07492\")"}]},{"repo":"katieluo88/280finalproj_nyudepth","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"712ab5ea073f843855636d2e2f67213732c148a2376d4a596dc79fb74dbcd7af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}