Depth Map Decomposition for Monocular Depth Estimation

23 Aug 2022  ·  Jinyoung Jun, Jae-Han Lee, Chul Lee, Chang-Su Kim ·

We propose a novel algorithm for monocular depth estimation that decomposes a metric depth map into a normalized depth map and scale features. The proposed network is composed of a shared encoder and three decoders, called G-Net, N-Net, and M-Net, which estimate gradient maps, a normalized depth map, and a metric depth map, respectively. M-Net learns to estimate metric depths more accurately using relative depth features extracted by G-Net and N-Net. The proposed algorithm has the advantage that it can use datasets without metric depth labels to improve the performance of metric depth estimation. Experimental results on various datasets demonstrate that the proposed algorithm not only provides competitive performance to state-of-the-art algorithms but also yields acceptable results even when only a small amount of metric depth data is available for its training.

PDF Abstract

Datasets


Results from the Paper


Ranked #38 on Monocular Depth Estimation on NYU-Depth V2 (using extra training data)

     Get a GitHub badge
Task Dataset Model Metric Name Metric Value Global Rank Uses Extra
Training Data
Result Benchmark
Monocular Depth Estimation NYU-Depth V2 Depth-Map-Decomposition-HRWSI RMSE 0.355 # 38
absolute relative error 0.098 # 35
Delta < 1.25 0.913 # 35
Delta < 1.25^2 0.987 # 32
Delta < 1.25^3 0.998 # 18
log 10 0.042 # 33
Monocular Depth Estimation NYU-Depth V2 Depth-Map-Decomposition RMSE 0.362 # 41
absolute relative error 0.100 # 38
Delta < 1.25 0.907 # 40
Delta < 1.25^2 0.986 # 34
Delta < 1.25^3 0.997 # 27
log 10 0.043 # 37

Methods


No methods listed for this paper. Add relevant methods here