Hierarchical Deep Stereo Matching on High Resolution Images - Robotics Institute Carnegie Mellon University

Hierarchical Deep Stereo Matching on High Resolution Images

G. Yang, J. Manela, M. Happold, and D. Ramanan
Conference Paper, Proceedings of (CVPR) Computer Vision and Pattern Recognition, pp. 5510 - 5519, June, 2019

Abstract

We explore the problem of real-time stereo matching on high-res imagery. Many state-of-the-art (SOTA) methods struggle to process high-res imagery because of memory constraints or speed limitations. To address this issue, we propose an end-to-end framework that searches for correspondences incrementally over a coarse-to-fine hierarchy. Because high-res stereo datasets are relatively rare, we introduce a dataset with high-res stereo pairs for both training and evaluation. Our approach achieved SOTA performance on Middlebury-v3 and KITTI-15 while running significantly faster than its competitors. The hierarchical design also naturally allows for anytime on-demand reports of disparity by capping intermediate coarse results, allowing us to accurately predict disparity for near-range structures with low latency (30ms). We demonstrate that the performance-vs-speed tradeoff afforded by on-demand hierarchies may address sensing needs for time-critical applications such as autonomous driving.

BibTeX

@conference{Yang-2019-121139,
author = {G. Yang and J. Manela and M. Happold and D. Ramanan},
title = {Hierarchical Deep Stereo Matching on High Resolution Images},
booktitle = {Proceedings of (CVPR) Computer Vision and Pattern Recognition},
year = {2019},
month = {June},
pages = {5510 - 5519},
}