2019 IEEE/CVF International Conference on Computer Vision (ICCV) 2019
DOI: 10.1109/iccv.2019.00448
|View full text |Cite
|
Sign up to set email alerts
|

DeepPruner: Learning Efficient Stereo Matching via Differentiable PatchMatch

Abstract: Our goal is to significantly speed up the runtime of current state-of-the-art stereo algorithms to enable real-time inference. Towards this goal, we developed a differentiable PatchMatch module that allows us to discard most disparities without requiring full cost volume evaluation. We then exploit this representation to learn which range to prune for each pixel. By progressively reducing the search space and effectively propagating such information, we are able to efficiently compute the cost volume for high … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
200
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 275 publications
(202 citation statements)
references
References 36 publications
2
200
0
Order By: Relevance
“…Then we apply another 1000 epochs to fine-tune our model on separate KITTI 2012/2015 datasets, with initial learning rate of 3 × 10 −5 and same schedule as before. Method GCNet [5] PSMNet [6] GANet [14] DeepPruner [18] DispNetC [7] StereoNet [19] AANet [9]…”
Section: Resultsmentioning
confidence: 99%
“…Then we apply another 1000 epochs to fine-tune our model on separate KITTI 2012/2015 datasets, with initial learning rate of 3 × 10 −5 and same schedule as before. Method GCNet [5] PSMNet [6] GANet [14] DeepPruner [18] DispNetC [7] StereoNet [19] AANet [9]…”
Section: Resultsmentioning
confidence: 99%
“…Our work is related to measuring uncertainty for 3D reconstruction. [5], [22] proposed to learn uncertainty from groundtruth for stereo. [21], [25] learned confidences based on deviation from median disparity.…”
Section: Related Workmentioning
confidence: 99%
“…For performance evaluations, we compare the proposed method to other stereo matching algorithms. The compared methods include adaptive support weight (ASW) [21], segmentation-based adaptive support weight (S-ASW) [23], plant leaf stereo matching (LP-SM) [36], edge-based stereo matching method (E-SM) [37], stereo matching implemented on GPU platform [31], AdaStereo [38], comparative evaluation of SGM variants for dense stereo matching (tMGM) [39], learning-based disparity estimation (iResNet) [40], and DeepPruner [41] methods. Tables 3 and 4 show that the performance of the proposed multi-scale ASW is superior to traditional ASW and other methods.…”
Section: Comparisons With Other Approachesmentioning
confidence: 99%