{"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/adadepth-unsupervised-content-congruent","title":"AdaDepth: Unsupervised Content Congruent Adaptation for Depth Estimation","arxiv_id":"1803.01599","date":"2018-03-05","proceeding":"CVPR 2018 6","authors":["Jogendra Nath Kundu","Phani Krishna Uppala","Anuj Pahuja","R. Venkatesh Babu"],"abstract":"Supervised deep learning methods have shown promising results for the task of\nmonocular depth estimation; but acquiring ground truth is costly, and prone to\nnoise as well as inaccuracies. While synthetic datasets have been used to\ncircumvent above problems, the resultant models do not generalize well to\nnatural scenes due to the inherent domain shift. Recent adversarial approaches\nfor domain adaption have performed well in mitigating the differences between\nthe source and target domains. But these methods are mostly limited to a\nclassification setup and do not scale well for fully-convolutional\narchitectures. In this work, we propose AdaDepth - an unsupervised domain\nadaptation strategy for the pixel-wise regression task of monocular depth\nestimation. The proposed approach is devoid of above limitations through a)\nadversarial learning and b) explicit imposition of content consistency on the\nadapted target representation. Our unsupervised approach performs competitively\nwith other established approaches on depth estimation tasks and achieves\nstate-of-the-art results in a semi-supervised setting.","url_abs":"http://arxiv.org/abs/1803.01599v2","url_pdf":"http://arxiv.org/pdf/1803.01599v2.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":[],"tasks":[{"task_slug":"depth-estimation","task_name":"Depth Estimation"},{"task_slug":"domain-adaptation","task_name":"Domain Adaptation"},{"task_slug":"monocular-depth-estimation","task_name":"Monocular Depth Estimation"},{"task_slug":"unsupervised-domain-adaptation","task_name":"Unsupervised Domain Adaptation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/unsupervised-domain-adaptation-on-virtual-2","task":"Unsupervised Domain Adaptation","dataset":"virtual KITTI to KITTI (MDE)","model":"AdaDepth","rank_in_archive_order":4,"of":4,"metrics":{"RMSE ":"6.251"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1803.01599","atlas_url":"https://app.syntology.ai/?focus=1803.01599","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":"1803.01599"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1803.01599\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1803.01599"},"call":"get_concepts_for_paper(arxiv_id=\"1803.01599\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"8e2e87e435c95ff7c3bd43be3e03629388d953629b39bcf66efd424283065e30","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}