Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Dynamic Spatial Propagation Network for Depth Completion #12

Open
lucasmmassa opened this issue Apr 24, 2022 · 3 comments
Open

Dynamic Spatial Propagation Network for Depth Completion #12

lucasmmassa opened this issue Apr 24, 2022 · 3 comments
Labels
abstract best Work with best benchmark performance at KITTI depth completion image paper with comprehensive image

Comments

@lucasmmassa
Copy link
Owner

https://www.aaai.org/AAAI22Papers/AAAI-490.LinY.pdf

@lucasmmassa lucasmmassa added the best Work with best benchmark performance at KITTI depth completion label Apr 24, 2022
@lucasmmassa lucasmmassa added this to Background Search in Digital Image Processing Project Apr 24, 2022
@jhonnye0 jhonnye0 added the image paper with comprehensive image label Apr 24, 2022
@jhonnye0
Copy link
Collaborator

image

@jhonnye0
Copy link
Collaborator

Image-guided depth completion aims to generate dense depth maps with sparse depth measurements and corresponding
RGB images. Currently, spatial propagation networks (SPNs) are the most popular affinity-based methods in depth completion, but they still suffer from the representation limitation of the fixed affinity and the over smoothing during iterations. Our solution is to estimate independent affinity matrices in each SPN iteration, but it is over-parameterized and heavy calculation. This paper introduces an efficient model that learns the affinity among neighboring pixels with an attention-based, dynamic approach. It decouples the neighborhood into parts regarding to different distances and recursively generates independent attention maps to refine these parts into adaptive affinity matrices. Furthermore, we adopt a diffusion suppression (DS) operation so that the model converges at an early stage to prevent oversmoothing of dense depth. Finally, in order to decrease the computational cost required, we also introduce three variations that reduce the amount of neighbors and attentions needed while still retaining similar accuracy.

@alexDJ-arch
Copy link

So the paper source code is not open until now, when will the author upload the code?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
abstract best Work with best benchmark performance at KITTI depth completion image paper with comprehensive image
Projects
Development

No branches or pull requests

3 participants