arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2007.10042cs.CV

Non-Local Spatial Propagation Network for Depth Completion

Korea Advanced Institute of Science and Technology(韩国科学技术院);Robotics Institute, Carnegie Mellon University(卡内基梅隆大学机器人研究所);Hikvision Research America(海康威视美国研究院)

Jinsun Park, Kyungdon Joo, Zhe Hu, Chi-Kuei Liu, In So Kweon

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑