Papers › Attention-based Context Aggregation Network for Monocular Depth Estimation

Attention-based Context Aggregation Network for Monocular Depth Estimation

29 Jan 2019arXiv:1901.10137archive 2025-07-28

Yuru Chen, Haitao Zhao, Zhengwei Hu

Depth estimation is a traditional computer vision task, which plays a crucial role in understanding 3D scene geometry. Recently, deep-convolutional-neural-networks based methods have achieved promising results in the monocular depth estimation field. Specifically, the framework that combines the multi-scale features extracted by the dilated convolution based block (atrous spatial pyramid pooling, ASPP) has gained the significant improvement in the dense labeling task. However, the discretized and predefined dilation rates cannot capture the continuous context information that differs in diverse scenes and easily introduce the grid artifacts in depth estimation. In this paper, we propose an attention-based context aggregation network (ACAN) to tackle these difficulties. Based on the self-attention model, ACAN adaptively learns the task-specific similarities between pixels to model the context information. First, we recast the monocular depth estimation as a dense labeling multi-class classification problem. Then we propose a soft ordinal inference to transform the predicted probabilities to continuous depth values, which can reduce the discretization error (about 1% decrease in RMSE). Second, the proposed ACAN aggregates both the image-level and pixel-level context information for depth estimation, where the former expresses the statistical characteristic of the whole image and the latter extracts the long-range spatial dependencies for each pixel. Third, for further reducing the inconsistency between the RGB image and depth map, we construct an attention loss to minimize their information entropy. We evaluate on public monocular depth-estimation benchmark datasets (including NYU Depth V2, KITTI). The experiments demonstrate the superiority of our proposed ACAN and achieve the competitive results with the state of the arts.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1901.10137")

Code

Syntology Ran 0 of 12 code samples harvested from 1 repository linked to this paper; 12 have no recorded run.

By repository: official repository: 12 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

miraiaroha/ACAN officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested; 0 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

12unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from miraiaroha/ACAN. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: 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. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

NormalDist miraiaroha/ACAN/code/models/losses.py official repository unverified MIT (permissive) · f1f5ec5fdff029e7 · report
continuous2discrete miraiaroha/ACAN/code/models/model.py official repository unverified MIT (permissive) · c80c792bc496ed80 · report
create_datasets miraiaroha/ACAN/code/dataloaders/get_datasets.py official repository unverified MIT (permissive) · 6c3dd8fb65a40c15 · report
create_lossfunc miraiaroha/ACAN/code/models/get_lossfunc.py official repository unverified MIT (permissive) · 1b4a913088f7e432 · report
create_network miraiaroha/ACAN/code/models/get_network.py official repository unverified MIT (permissive) · 7f991c24c3f646bc · report
create_optimizer miraiaroha/ACAN/code/creator/optimizer.py official repository unverified MIT (permissive) · d07cbe27712d5d01 · report
create_params miraiaroha/ACAN/code/creator/params.py official repository unverified MIT (permissive) · 419d8a3c9480d263 · report
create_scheduler miraiaroha/ACAN/code/creator/scheduler.py official repository unverified MIT (permissive) · c60cc48bb993e02b · report
discrete2continuous miraiaroha/ACAN/code/models/model.py official repository unverified MIT (permissive) · 808145c33a4f073c · report
get_params miraiaroha/ACAN/code/creator/params.py official repository unverified MIT (permissive) · 8049f1ba083fcffa · report
img_loader miraiaroha/ACAN/code/dataloaders/dataloader.py official repository unverified MIT (permissive) · b66f1ba79bd18978 · report
make_decoder miraiaroha/ACAN/code/models/model.py official repository unverified MIT (permissive) · 07440157233b90f7 · report

Tasks

Depth EstimationMonocular Depth EstimationMulti-class Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Monocular Depth Estimation NYU-Depth V2 ACAN RMSE 0.496 #64 of 85 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections