Learning Inverse Laplacian Pyramid for Progressive Depth Completion
Kun Wang, Zhiqiang Yan, Junkai Fan, Jun Li, Jian Yang

TL;DR
LP-Net introduces a multi-scale, progressive depth completion framework using Laplacian Pyramid decomposition, achieving state-of-the-art results with improved efficiency by globally capturing scene context and refining details iteratively.
Contribution
The paper presents LP-Net, a novel multi-scale depth completion method with two new modules, outperforming existing approaches in accuracy and computational efficiency.
Findings
Achieves SOTA performance on KITTI, NYUv2, and TOFDC benchmarks.
Ranks 1st among peer-reviewed methods on KITTI leaderboard.
Demonstrates superior efficiency compared to propagation-based methods.
Abstract
Depth completion endeavors to reconstruct a dense depth map from sparse depth measurements, leveraging the information provided by a corresponding color image. Existing approaches mostly hinge on single-scale propagation strategies that iteratively ameliorate initial coarse depth estimates through pixel-level message passing. Despite their commendable outcomes, these techniques are frequently hampered by computational inefficiencies and a limited grasp of scene context. To circumvent these challenges, we introduce LP-Net, an innovative framework that implements a multi-scale, progressive prediction paradigm based on Laplacian Pyramid decomposition. Diverging from propagation-based approaches, LP-Net initiates with a rudimentary, low-resolution depth prediction to encapsulate the global scene context, subsequently refining this through successive upsampling and the reinstatement of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsIndustrial Vision Systems and Defect Detection
MethodsLaplacian Pyramid
