Command Palette
Search for a command to run...
Jinsun Park; Kyungdon Joo; Zhe Hu; Chi-Kuei Liu; In So Kweon

Abstract
In this paper, we propose a robust and efficient end-to-end non-local spatial propagation network for depth completion. The proposed network takes RGB and sparse depth images as inputs and estimates non-local neighbors and their affinities of each pixel, as well as an initial depth map with pixel-wise confidences. The initial depth prediction is then iteratively refined by its confidence and non-local spatial propagation procedure based on the predicted non-local neighbors and corresponding affinities. Unlike previous algorithms that utilize fixed-local neighbors, the proposed algorithm effectively avoids irrelevant local neighbors and concentrates on relevant non-local neighbors during propagation. In addition, we introduce a learnable affinity normalization to better learn the affinity combinations compared to conventional methods. The proposed algorithm is inherently robust to the mixed-depth problem on depth boundaries, which is one of the major issues for existing depth estimation/completion algorithms. Experimental results on indoor and outdoor datasets demonstrate that the proposed algorithm is superior to conventional algorithms in terms of depth completion accuracy and robustness to the mixed-depth problem. Our implementation is publicly available on the project page.
Code Repositories
Benchmarks
| Benchmark | Methodology | Metrics |
|---|---|---|
| depth-completion-on-kitti-depth-completion | NLSPN | MAE: 199.59 RMSE: 741.68 Runtime [ms]: 220 iMAE: 0.84 iRMSE: 1.99 |
| depth-completion-on-nyu-depth-v2 | NLSPN | REL: 0.012 RMSE: 0.092 |
| depth-completion-on-void | NLSPN | MAE: 26.736 RMSE: 79.121 iMAE: 12.703 iRMSE: 33.876 |
| stereo-lidar-fusion-on-kitti-depth-completion | NLSPN | RMSE: 771.8 |
Build AI with AI
From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.