{"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/adabins-depth-estimation-using-adaptive-bins","title":"AdaBins: Depth Estimation using Adaptive Bins","arxiv_id":"2011.14141","date":"2020-11-28","proceeding":"CVPR 2021 1","authors":["Shariq Farooq Bhat","Ibraheem Alhashim","Peter Wonka"],"abstract":"We address the problem of estimating a high quality dense depth map from a single RGB input image. We start out with a baseline encoder-decoder convolutional neural network architecture and pose the question of how the global processing of information can help improve overall depth estimation. To this end, we propose a transformer-based architecture block that divides the depth range into bins whose center value is estimated adaptively per image. The final depth values are estimated as linear combinations of the bin centers. We call our new building block AdaBins. Our results show a decisive improvement over the state-of-the-art on several popular depth datasets across all metrics. We also validate the effectiveness of the proposed block with an ablation study and provide the code and corresponding pre-trained weights of the new state-of-the-art model.","url_abs":"https://arxiv.org/abs/2011.14141v1","url_pdf":"https://arxiv.org/pdf/2011.14141v1.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":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/shariqfarooq123/AdaBins","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/danielzgsilva/MonoDepthAttacks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/dylanauty/mde-biological-vision-systems","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/martius-lab/beta-nll","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/2023-MindSpore-1/ms-code-16/tree/main/AdaBin","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/2023-MindSpore-1/ms-code-224/tree/main/AdaBin","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/2023-MindSpore-4/Code8/tree/main/AdaBin","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/2024-MindSpore-1/Code5/tree/main/AdaBin","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/2024-MindSpore-1/Code6/tree/main/AdaBin","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/MindSpore-paper-code-3/code6/tree/main/ADNet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"adabins-depth-estimation-using-adaptive-bins","repo_url":"https://github.com/code-implementation1/Code2/tree/main/AdaBin","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"depth-estimation","task_name":"Depth Estimation"},{"task_slug":"monocular-depth-estimation","task_name":"Monocular Depth Estimation"}],"methods":[{"method_slug":"adaptivebins","method_name":"AdaptiveBins"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"efficientnet","method_name":"EfficientNet"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"vision-transformer","method_name":"Vision Transformer"}],"datasets_introduced":[],"methods_introduced":[{"slug":"adaptivebins","name":"AdaptiveBins","full_name":"Adaptive Bins"}],"results":[{"leaderboard":"/sota/depth-estimation-on-nyu-depth-v2","task":"Depth Estimation","dataset":"NYU-Depth V2","model":"AdaBins","rank_in_archive_order":7,"of":17,"metrics":{"RMS":"0.364"},"uses_additional_data":false},{"leaderboard":"/sota/monocular-depth-estimation-on-kitti-eigen","task":"Monocular Depth Estimation","dataset":"KITTI Eigen split","model":"AdaBins","rank_in_archive_order":35,"of":79,"metrics":{"Delta < 1.25":"0.964","Delta < 1.25^2":"0.995","Delta < 1.25^3":"0.999","RMSE":"2.360","RMSE log":"0.088","absolute relative error":"0.058"},"uses_additional_data":true},{"leaderboard":"/sota/monocular-depth-estimation-on-nyu-depth-v2","task":"Monocular Depth Estimation","dataset":"NYU-Depth V2","model":"AdaBins","rank_in_archive_order":52,"of":85,"metrics":{"Delta < 1.25":"0.903","Delta < 1.25^2":"0.984","Delta < 1.25^3":"0.997","RMSE":"0.364","absolute relative error":"0.103","log 10":"0.044"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2011.14141","atlas_url":"https://app.syntology.ai/?focus=2011.14141","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":"2011.14141"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2011.14141\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2011.14141"},"call":"get_concepts_for_paper(arxiv_id=\"2011.14141\")"}],"by_repo":[{"repo":"shariqfarooq123/AdaBins","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2310.15171"],"harvested_for_calls":[{"arxiv_id":"2310.15171","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2310.15171"},"call":"get_harvested_code_for_paper(arxiv_id=\"2310.15171\")"}]},{"repo":"danielzgsilva/MonoDepthAttacks","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dylanauty/mde-biological-vision-systems","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"martius-lab/beta-nll","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2106.03443","2203.09168"],"harvested_for_calls":[{"arxiv_id":"2106.03443","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.03443"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.03443\")"},{"arxiv_id":"2203.09168","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.09168"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.09168\")"}]},{"repo":"2023-MindSpore-1/ms-code-16","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-1/ms-code-224","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2023-MindSpore-4/Code8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2024-MindSpore-1/Code5","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"2024-MindSpore-1/Code6","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"MindSpore-paper-code-3/code6","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"code-implementation1/Code2","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":"e894314e4f55bc1d4243a572c238914534bf5476554bc0f6629b24c4361f5143","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}