2018 15th Conference on Computer and Robot Vision (CRV) 2018
DOI: 10.1109/crv.2018.00013
|View full text |Cite
|
Sign up to set email alerts
|

In Defense of Classical Image Processing: Fast Depth Completion on the CPU

Abstract: With the rise of data driven deep neural networks as a realization of universal function approximators, most research on computer vision problems has moved away from hand crafted classical image processing algorithms. This paper shows that with a well designed algorithm, we are capable of outperforming neural network based methods on the task of depth completion. The proposed algorithm is simple and fast, runs on the CPU, and relies only on basic image processing operations to perform depth completion of spars… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
135
0
1

Year Published

2018
2018
2020
2020

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 250 publications
(163 citation statements)
references
References 17 publications
2
135
0
1
Order By: Relevance
“…Ku et al propose a non-learning based approach to this problem to highlight the effectiveness of well crafted classical methods, using only commonly available morphological operations to produce dense depth information [14]. Their proposed method currently out-performs multiple deep learning based methods on the KITTI depth completion benchmark.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Ku et al propose a non-learning based approach to this problem to highlight the effectiveness of well crafted classical methods, using only commonly available morphological operations to produce dense depth information [14]. Their proposed method currently out-performs multiple deep learning based methods on the KITTI depth completion benchmark.…”
Section: Related Workmentioning
confidence: 99%
“…Our color and depth branches begin with an initial depth filling step, similar to the approach of Ku et al [14]. We use a simple sequence of morphological operations and Gaussian blurring operations to fill the holes in the sparse depth image with depth values from nearby valid points such that no holes remain.…”
Section: B Feature Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…Generating 3D Instance Training Data The sparse Li-DAR scan is first interpolated using [19] and converted into a 3 channel tensor J using the provided camera calibration, with each pixel representing a point (x, y, z). Points within ground truth boxes are considered as the set of points for an instance.…”
Section: Instance Reconstructionmentioning
confidence: 99%
“…However the sparsity of LiDAR data only provides a low resolution perspective of the scene. We therefore take the portion of the LiDAR scan corresponding to the visible portion of the scene in the RGB image, and process it through a structure preserving depth completion algorithm [37]. In particular, the LiDAR points are projected into the image using the provided 3 × 4 camera projection matrix P cam creating a sparse depth map D s .…”
Section: A Virtual Multi-view Synthesismentioning
confidence: 99%