{"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/depth-map-prediction-from-a-single-image","title":"Depth Map Prediction from a Single Image using a Multi-Scale Deep Network","arxiv_id":"1406.2283","date":"2014-06-09","proceeding":"NeurIPS 2014 12","authors":["David Eigen","Christian Puhrsch","Rob Fergus"],"abstract":"Predicting depth is an essential component in understanding the 3D geometry\nof a scene. While for stereo images local correspondence suffices for\nestimation, finding depth relations from a single image is less\nstraightforward, requiring integration of both global and local information\nfrom various cues. Moreover, the task is inherently ambiguous, with a large\nsource of uncertainty coming from the overall scale. In this paper, we present\na new method that addresses this task by employing two deep network stacks: one\nthat makes a coarse global prediction based on the entire image, and another\nthat refines this prediction locally. We also apply a scale-invariant error to\nhelp measure depth relations rather than scale. By leveraging the raw datasets\nas large sources of training data, our method achieves state-of-the-art results\non both NYU Depth and KITTI, and matches detailed depth boundaries without the\nneed for superpixelation.","url_abs":"http://arxiv.org/abs/1406.2283v1","url_pdf":"http://arxiv.org/pdf/1406.2283v1.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":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/MasazI/cnn_depth_tensorflow","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/SeokjuLee/Insta-DM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/Tom-Zheng/depth_single_image","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/dsshim0125/dacl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/kieran514/dyna-dm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/sejong-rcv/2021.Paper.TransDSSL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/shuuchen/depth_eigen","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/zhengtr/CS231N-Final-Project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/imran3180/depth-map-prediction","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"depth-map-prediction-from-a-single-image","repo_url":"https://github.com/mindspore-ai/models/tree/master/official/cv/depthnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"3d-geometry","task_name":"3D geometry"},{"task_slug":"monocular-depth-estimation","task_name":"Monocular Depth Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1406.2283","atlas_url":"https://app.syntology.ai/?focus=1406.2283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.2283"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1406.2283"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1406.2283"},"call":"get_harvested_code_for_paper(arxiv_id=\"1406.2283\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1406.2283"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1406.2283\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1406.2283"},"call":"get_concepts_for_paper(arxiv_id=\"1406.2283\")"}],"by_repo":[{"repo":"MasazI/cnn_depth_tensorflow","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"SeokjuLee/Insta-DM","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2102.02629"],"harvested_for_calls":[{"arxiv_id":"2102.02629","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2102.02629"},"call":"get_harvested_code_for_paper(arxiv_id=\"2102.02629\")"}]},{"repo":"Tom-Zheng/depth_single_image","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dsshim0125/dacl","kind":"listed","samples":4,"ran":3,"instrument":1,"unverified":1},{"repo":"kieran514/dyna-dm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sejong-rcv/2021.Paper.TransDSSL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"shuuchen/depth_eigen","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zhengtr/CS231N-Final-Project","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"imran3180/depth-map-prediction","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mindspore-ai/models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2208.08084"],"harvested_for_calls":[{"arxiv_id":"2208.08084","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2208.08084"},"call":"get_harvested_code_for_paper(arxiv_id=\"2208.08084\")"}]}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1406.2283.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1406.2283.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MasazI/cnn_depth_tensorflow","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sejong-rcv/2021.Paper.TransDSSL","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kieran514/dyna-dm","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Tom-Zheng/depth_single_image","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/SeokjuLee/Insta-DM","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mindspore-ai/models/tree/master/official/cv/depthnet","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/shuuchen/depth_eigen","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zhengtr/CS231N-Final-Project","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dsshim0125/dacl","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/imran3180/depth-map-prediction","reach":{"status":"ok"}}],"summary":{"ran_draft_wrong":1,"ran":2,"unverified":1},"n_samples":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":4,"ran":3,"n_ran_checked":2,"n_instrument":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":1,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"e69a02125b63e4ca","code_sha256_prefix":"e69a02125b63e4ca","entry":"get_nonlinearity_layer","repo":"dsshim0125/dacl","repo_kind":"listed","path":"models/networks.py","file_url":"https://github.com/dsshim0125/dacl/blob/HEAD/models/networks.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"activation_type:str/0/str","fixture_out_type":"PReLU","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/get-nonlinearity-layer","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from ccc870206/3D-PL, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"e69a02125b63e4ca"}},{"code_sha256":"8da796d8d2d055b4","code_sha256_prefix":"8da796d8d2d055b4","entry":"get_norm_layer","repo":"dsshim0125/dacl","repo_kind":"listed","path":"models/networks.py","file_url":"https://github.com/dsshim0125/dacl/blob/HEAD/models/networks.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"norm_type:str/0/str","fixture_out_type":"partial","level_recorded_at":"2026-09-25T11:37:59.709563+00:00","code_page":"/code/get-norm-layer","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8da796d8d2d055b4"}},{"code_sha256":"5abe64f7ba385310","code_sha256_prefix":"5abe64f7ba385310","entry":"get_scheduler","repo":"dsshim0125/dacl","repo_kind":"listed","path":"models/networks.py","file_url":"https://github.com/dsshim0125/dacl/blob/HEAD/models/networks.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"optimizer:Adam/0/?, opt:OptConfig/0/?","fixture_out_type":"LambdaLR","level_recorded_at":"2026-09-26T04:29:16.584584+00:00","code_page":"/code/get-scheduler","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5abe64f7ba385310"}},{"code_sha256":"b017aa113f28018a","code_sha256_prefix":"b017aa113f28018a","entry":"bilinear_sampler_1d_h","repo":"dsshim0125/dacl","repo_kind":"listed","path":"utils/bilinear_sampler.py","file_url":"https://github.com/dsshim0125/dacl/blob/HEAD/utils/bilinear_sampler.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"b017aa113f28018a"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a6d97ee30322bdbe0fe0fe57e5b070a2987392a67899768d250bdaf77568d31e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}