Efficient Depth Completion Using Learned Bases
원문 초록
In this paper, we propose a new global geometry constraint for depth completion. By assuming depth maps often lay on low dimensional subspaces, a dense depth map can be approximated by a weighted sum of full-resolution principal depth bases. The principal components of depth fields can be learned from natural depth maps. The given sparse depth points are served as a data term to constrain the weighting process. When the input depth points are too sparse, the recovered dense depth maps are often over smoothed. To address this issue, we add a colour-guided auto-regression model as another regularization term. It assumes the reconstructed depth maps should share the same nonlocal similarity in the accompanying colour image. Our colour-guided PCA depth completion method has closed-form solutions, thus can be efficiently solved and is significantly more accurate than PCA only method. Extensive experiments on KITTI and Middlebury datasets demonstrate the superior performance of our proposed method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
PacGDC: Label-Efficient Generalizable Depth Completion with Projection Ambiguity and Consistency
DEPTHOR: Depth Enhancement from a Practical Light-Weight dToF Sensor and RGB Image
Vanishing Depth: A Depth Adapter with Positional Depth Encoding for Generalized Image Encoders
SVDC: Consistent Direct Time-of-Flight Video Depth Completion with Frequency Selective Fusion
TranSplat: Surface Embedding-guided 3D Gaussian Splatting for Transparent Object Manipulation
TDCNet: Transparent Objects Depth Completion with CNN-Transformer Dual-Branch Parallel Network
토론
이 논문과 연결된 포럼 글이 아직 없습니다.