Depth-Independent Depth Completion via Least Square Estimation
원문 초록
The depth completion task aims to complete a per-pixel dense depth map from a sparse depth map. In this paper, we propose an efficient least square based depth-independent method to complete the sparse depth map utilizing the RGB image and the sparse depth map in two independent stages. In this way can we decouple the neural network and the sparse depth input, so that when some features of the sparse depth map change, such as the sparsity, our method can still produce a promising result. Moreover, due to the positional encoding and linear procession in our pipeline, we can easily produce a super-resolution dense depth map of high quality. We also test the generalization of our method on different datasets compared to some state-of-the-art algorithms. Experiments on the benchmark show that our method produces competitive performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DEPTHOR: Depth Enhancement from a Practical Light-Weight dToF Sensor and RGB Image
Depth Anything with Any Prior
IM-LUT: Interpolation Mixing Look-Up Tables for Image Super-Resolution
PanoDiff-SR: Synthesizing Dental Panoramic Radiographs using Diffusion and Super-resolution
PacGDC: Label-Efficient Generalizable Depth Completion with Projection Ambiguity and Consistency
HNOSeg-XS: Extremely Small Hartley Neural Operator for Efficient and Resolution-Robust 3D Image Segmentation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.